Saturation and simple extensions of models of Peano arithmetic
If e is an element of a model M of PA, then M is called e-lofty if for every recursive type t(v) with a finite number of parameters from M, if t(v) is finitely realizable in M then so is the type t(v)\(\cup \{v\in S\}\) for some \(S\in M\) of size e (in M). A model M is lofty if it is e- lofty for some e in M. It is shown that, at least for countable models, the lofty models are precisely those models which have recursively saturated simple extensions. The lofty models form an intermediate class between tall models and recursively saturated models. A sharp version of this result is given by showing that if I is an initial segment of M closed under multiplication then there is an elementary extension N of M such that I is the set of those elements of N for which N is not e-lofty. Various notions of loftiness and relations between them are considered. It is also shown that (unlike recursively saturated models) lofty models do not form a \(PC^*_{\delta}\) class. All the results have their bounded (short) versions. The paper is concluded by a list of problems concerning uncountable lofty models.
- A Rather Classless Model
- Closure properties of countable non-standard integers
- scientific article; zbMATH DE number 3732051 (Why is no real title available?)
- scientific article; zbMATH DE number 3534482 (Why is no real title available?)
- scientific article; zbMATH DE number 3566838 (Why is no real title available?)
- scientific article; zbMATH DE number 1222930 (Why is no real title available?)
- scientific article; zbMATH DE number 3204609 (Why is no real title available?)
- scientific article; zbMATH DE number 3316888 (Why is no real title available?)
- Models with second order properties II. Trees with no undefined branches
- On cofinal extensions of models of arithmetic
- Saturated models of Peano arithmetic
- Ultraproducts which are not saturated
- Minimal satisfaction classes with an application to rigid models of Peano arithmetic
- Modeling vagueness by nonstandardness
- Set theoretical analogues of the Barwise-Schlipf theorem
- Automorphism groups of countable arithmetically saturated models of Peano arithmetic
- Recursively saturated nonstandard models of arithmetic; addendum
- Remarks on weak notions of saturation in models of Peano arithmetic
- Models with the ω-property
- Extendible Sets in Peano Arithmetic
- Meager sets on the hyperfinite time line
- On expandability of models of Peano arithmetic to models of the alternative set theory
- The Barwise-Schlipf theorem
- Nonstandard definability
This page was built for publication: Saturation and simple extensions of models of Peano arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762144)