Recursively saturated, rather classless models of peano arithmetic

K. J. Barwise and J. Schlipf, On recursively saturated models of arithmetic, Model Theory and Algebra, Lecture Notes in Mathematics 498, Springer-Verlag, Berlin, 1976, pp. 42–55.
Chapter Google Scholar
J. E. Baumgartner, J. I. Malitz, and W. Reinhardt, Embedding trees in the rationals, Proc. Nat. Acad. Sci. USA. 67 (1970), 1748–1753.
Article MathSciNet MATH Google Scholar
H. Gaifman, A note on models and submodels of arithmetic, Conference in Mathematical Logic-London '70, Lecture Notes in Mathematics 255, Springer-Verlag, Heidelberg, 1972, pp. 128–144.
Chapter Google Scholar
R. B. Jensen, The fine structure of the constructible hierarchy, Annals Math. Logic 4 (1972), 229–308.
Article MathSciNet MATH Google Scholar
M. Kaufmann, A rather classless model, Proc. A.M.S. 62 (1977), 330–333.
Article MathSciNet MATH Google Scholar
H. Kotlarski, On elementary cuts in models of arithmetic, II, (preprint).
Google Scholar
R. MacDowell and E. Specker, Modelle der Arithmetik, Infinitistic Methods, Proceedings of the Symposium on the Foundations of Mathematics (Warsaw, 1959), Pergammon, 1961, pp. 257–263.
Google Scholar
W. Mitchell, Aronszajn trees and the independence of the transfer property, Annals Math. Logic 5 (1972), 21–46.
Article MathSciNet MATH Google Scholar
J. S. Schlipf, A guide to the identification of admissible sets above structures, Annals Math. Logic 12 (1977), 151–192.
Article MathSciNet MATH Google Scholar
J. H. Schmerl, Peano models with many generic classes, Pacific J. Math. 46 (1973), 523–536.
Article MathSciNet MATH Google Scholar
S. Shelah, Models with second order properties II. Trees with no undefined branches, Annals Math. Logic 14 (1978), 73–87.
Article MathSciNet MATH Google Scholar
C. Smorynski and J. Stavi, Cofinal extension preserves recursive saturation, (preprint).
Google Scholar

Download references

Author information

Authors and Affiliations

Department of Mathematics, University of Connecticut, 06268, Storrs, Connecticut
James H. Schmerl

Authors

James H. Schmerl
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Manuel Lerman James H. Schmerl Robert I. Soare

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Schmerl, J.H. (1981). Recursively saturated, rather classless models of peano arithmetic. In: Lerman, M., Schmerl, J.H., Soare, R.I. (eds) Logic Year 1979–80. Lecture Notes in Mathematics, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090952

Download citation

DOI: https://doi.org/10.1007/BFb0090952
Published: 05 October 2006
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10708-8
Online ISBN: 978-3-540-38673-5
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Recursively saturated, rather classless models of peano arithmetic

Access this chapter

Preview

References