Models and types of Peano's arithmetic
From MaRDI portal
Publication:4096940
DOI10.1016/0003-4843(76)90002-4zbMath0332.02058OpenAlexW2054770471MaRDI QIDQ4096940
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
Related Items
Recursively saturated nonstandard models of arithmetic, Finite Substructure Lattices of Models of Peano Arithmetic, Automorphisms of models of true arithmetic: Recognizing some basic open subgroups, The Complexity of Classification Problems for Models of Arithmetic, Weakly Definable Types, Automorphisms of models of arithmetic: a unified view, Iterated ultrapowers for the masses, Automorphisms of countable recursively saturated models of PA: A survey, Four problems concerning recursively saturated models of arithmetic, \(\text{PA} (aa)\), Infinitary definitions of equivalence relations in models of PA, Model-theoretic applications of cofinality spectrum problems, End extensions of models of fragments of \(\mathrm{PA}\), Tanaka's theorem revisited, The classification of countable models of set theory, Fixed points of self-embeddings of models of arithmetic, Automorphisms of recursively saturated models of arithmetic, Interstitial and pseudo gaps in models of Peano Arithmetic, Some observations on the substructure lattice of a Δ1 ultrapower, European Summer Meeting of the Association for Symbolic Logic, Hull, 1986, On cofinal submodels and elementary interstices, A new omitting types theorem for L(Q), Sub-arithmetical ultrapowers: A survey, Ehrenfeucht's lemma in set theory, R.e. Prime powers and total rigidity, A standard model of Peano arithmetic with no conservative elementary extension, A model of peano arithmetic with no elementary end extension, Scott's problem for Proper Scott sets, Automorphism groups of models of Peano arithmetic, Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic, Rank-initial embeddings of non-standard models of set theory, Ultrafilters and types on models of arithmetic, Decoding in the automorphism group of a recursively saturated model 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, Minimal elementary extensions of models of set theory and arithmetic
