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