Skip to main content

Two orderings of the class of all countable models of peano arithmetic

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

Keywords

  • Free Variable
  • Initial Segment
  • Countable Model
  • Completeness Theorem
  • Peano Arithmetic

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.00
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. H. Friedman, Countable models of set theories, in Proc. Cambridge Summer School in Logic, Matthias and Rogers eds., Lecture Notes in Mathematics vol. 337, p. 539–573.

    Google Scholar 

  2. D. Guaspari, Partially conservative extensions of arithmetic, Transactions of the AMS.

    Google Scholar 

  3. L.A.S. Kirby, Initial segments of models of arithmetic, thesis, Manchester Univ. 1977.

    Google Scholar 

  4. L.A.S. Kirby, and J.B. Paris, Initial segments of models of Peano’s axioms.

    Google Scholar 

  5. R. Murawski: thesis, Warsaw University 1978.

    Google Scholar 

  6. C. Smoryński, Recursively Saturated Nonstandard Models of Arithmetic.

    Google Scholar 

  7. K. McAloon, Diagonal methods and strong cuts in models of arithmetic, in Logic Colloquium 77, eds. A. Macintyre, L. Pacholski, J. Paris, p. 171–182.

    Google Scholar 

  8. L. Kirby, K. McAloon, R. Murawski: Indicators, recursive saturation and expandability, Fund. Math. (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Hájek, P., Pudlák, P. (1980). Two orderings of the class of all countable models of peano arithmetic. In: Pacholski, L., Wierzejewski, J., Wilkie, A.J. (eds) Model Theory of Algebra and Arithmetic. Lecture Notes in Mathematics, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090166

Download citation

  • DOI: https://doi.org/10.1007/BFb0090166

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10269-4

  • Online ISBN: 978-3-540-38393-2

  • eBook Packages: Springer Book Archive