Remarks on weak notions of saturation in models of Peano arithmetic
DOI10.2307/2273867zbMATH Open0619.03027OpenAlexW1992833344MaRDI QIDQ3755444FDOQ3755444
Authors: Matt Kaufmann, James H. Schmerl
Publication date: 1987
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273867
Recommendations
saturated modelminimal modelsrecursively saturatedcountable modelsmodels of Peano arithmeticdiagonal methodsstandard cutrecursively definable
Models with special properties (saturated, rigid, etc.) (03C50) Models of arithmetic and set theory (03C62)
Cites Work
Cited In (17)
- Title not available (Why is that?)
- A Rather Classless Model
- The Barwise-Schlipf theorem
- Title not available (Why is that?)
- The Recursively Saturated Part of Models of Peano Arithmetic
- Elementary cuts in saturated models of Peano arithmetic
- Models with the ω-property
- Set theoretic properties of Loeb measure
- Decoding in the automorphism group of a recursively saturated model of arithmetic
- Some highly saturated models of Peano arithmetic
- Title not available (Why is that?)
- Definability of initial segments
- Minimal satisfaction classes with an application to rigid models of Peano arithmetic
- Saturation and simple extensions of models of Peano arithmetic
- On M-recursively saturated models of arithmetic
- Models of Peano arithmetic and a question of Sikorski on ordered fields
- Models of expansions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathbb N}$\end{document} with no end extensions
This page was built for publication: Remarks on weak notions of saturation in models of Peano arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755444)