Saturation and simple extensions of models of Peano arithmetic

DOI10.1016/0168-0072(84)90008-3MaRDI QIDQ762144zbMATH OpenOpenAlexFDO

Authors Matt Kaufmann, James H. Schmerl

Publication date 1984

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-0072(84)90008-3

zbMATH Keywords

simple extensioncofinal extensionlofty modelsmodel of arithmeticrecursively saturated modelstall models

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)

Recommendations

• Remarks on weak notions of saturation in models of Peano arithmetic
• Cofinal elementary extensions
• A Rather Classless Model
• On M-recursively saturated models of arithmetic
• Some highly saturated models of Peano arithmetic

Cites work

• 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?)
• A Rather Classless Model
• Closure properties of countable non-standard integers
• 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

Cited in

(12)

• Automorphism groups of countable arithmetically saturated models of Peano arithmetic
• Minimal satisfaction classes with an application to rigid models of Peano arithmetic
• Set theoretical analogues of the Barwise-Schlipf theorem
• Extendible Sets in Peano Arithmetic
• On expandability of models of Peano arithmetic to models of the alternative set theory
• Nonstandard definability
• Recursively saturated nonstandard models of arithmetic; addendum
• Models with the ω-property
• The Barwise-Schlipf theorem
• Meager sets on the hyperfinite time line
• Modeling vagueness by nonstandardness
• Remarks on weak notions of saturation in models of Peano arithmetic

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)