Models and types of Peano's arithmetic

DOI10.1016/0003-4843(76)90002-4MaRDI QIDQ4096940zbMATH OpenOpenAlexFDO

Authors Haim Gaifman

Publication date 1976

Published in Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0003-4843(76)90002-4

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Other classical first-order model theory (03C68)

Cited in

(38)

• Ultrafilters and types on models of arithmetic
• Automorphisms of recursively saturated models of arithmetic
• A weakly definable type which is not definable
• On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
• Automorphisms of models of true arithmetic: Recognizing some basic open subgroups
• Infinitary definitions of equivalence relations in models of PA
• Iterated ultrapowers for the masses
• Fixed points of self-embeddings of models of arithmetic
• On cofinal submodels and elementary interstices
• Ehrenfeucht's lemma in set theory
• Automorphisms of countable recursively saturated models of PA: A survey
• Four problems concerning recursively saturated models of arithmetic
• \(\text{PA} (aa)\)
• End extensions of models of fragments of \(\mathrm{PA}\)
• Tanaka's theorem revisited
• Sub-arithmetical ultrapowers: A survey
• R.e. Prime powers and total rigidity
• Model-theoretic applications of cofinality spectrum problems
• Weakly Definable Types
• European Summer Meeting of the Association for Symbolic Logic, Hull, 1986
• The complexity of classification problems for models of arithmetic
• Interstitial and pseudo gaps in models of Peano arithmetic
• Some observations on the substructure lattice of a _1 ultrapower
• Scott's problem for Proper Scott sets
• Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic
• A new omitting types theorem for L(Q)
• Recursively saturated nonstandard models of arithmetic
• A model of peano arithmetic with no elementary end extension
• Automorphism groups of models of Peano arithmetic
• Finite Substructure Lattices of Models of Peano Arithmetic
• The classification of countable models of set theory
• Decoding in the automorphism group of a recursively saturated model of arithmetic
• The structural complexity of models of arithmetic
• The lattice problem for models of \(\mathsf{PA}\)
• Rank-initial embeddings of non-standard models of set theory
• Minimal elementary extensions of models of set theory and arithmetic
• Automorphisms of models of arithmetic: a unified view
• A standard model of Peano arithmetic with no conservative elementary extension

This page was built for publication: Models and types of Peano's arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096940)