Skip to main content

Recursively saturated, rather classless models of peano arithmetic

Part of the Lecture Notes in Mathematics book series (LNM,volume 859)

Keywords

  • Tree Property
  • Regular Cardinal
  • Conservative Extension
  • Peano Arithmetic
  • Elementary Substructure

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    CrossRef  Google Scholar 

  2. J. E. Baumgartner, J. I. Malitz, and W. Reinhardt, Embedding trees in the rationals, Proc. Nat. Acad. Sci. USA. 67 (1970), 1748–1753.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. 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.

    CrossRef  Google Scholar 

  4. R. B. Jensen, The fine structure of the constructible hierarchy, Annals Math. Logic 4 (1972), 229–308.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. M. Kaufmann, A rather classless model, Proc. A.M.S. 62 (1977), 330–333.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. H. Kotlarski, On elementary cuts in models of arithmetic, II, (preprint).

    Google Scholar 

  7. 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 

  8. W. Mitchell, Aronszajn trees and the independence of the transfer property, Annals Math. Logic 5 (1972), 21–46.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. J. S. Schlipf, A guide to the identification of admissible sets above structures, Annals Math. Logic 12 (1977), 151–192.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. J. H. Schmerl, Peano models with many generic classes, Pacific J. Math. 46 (1973), 523–536.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. S. Shelah, Models with second order properties II. Trees with no undefined branches, Annals Math. Logic 14 (1978), 73–87.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. C. Smorynski and J. Stavi, Cofinal extension preserves recursive saturation, (preprint).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

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:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10708-8

  • Online ISBN: 978-3-540-38673-5

  • eBook Packages: Springer Book Archive