Skip to main content

Cofinal extension preserves recursive saturation

  • Conference paper
  • First Online:
Model Theory of Algebra and Arithmetic

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • J. Barwise and J. Schlipf 1976 An introduction to recursively saturated and resplendent models, JSL 41, pp. 531–536.

    MathSciNet  MATH  Google Scholar 

  • H. Friedman 1973 Countable models of set theories, in: A.R.D. Mathias and H. Rogers, eds., Cambridge Summer School in Mathematical Logic, Springer-Verlag, Heidelberg.

    Google Scholar 

  • H. Gaifman 1972 A note on models and submodels of arithmetic, in: W. Hodges, ed., Conference in Mathematical Logic— London ’70, Springer-Verlag, Heidelberg.

    Google Scholar 

  • L. Kirby and J. Paris 1977 Initial segments of models of Peano’s axioms, in: A. Lachlan, M. Srebrny, and A. Zarach, eds., Set Theory and Hierarchy Theory V, Springer-Verlag, Heidelberg.

    Google Scholar 

  • H. Kotlarski A On elementary recursively saturated cuts in models of Peano arithmetic, to appear.

    Google Scholar 

  • H. Lesan 1978 Models of arithmetic, dissertation, Manchester.

    Google Scholar 

  • J. Paris and G. Mills 1979 Closure properties of countable non-standard integers, Fund. Math. 103, pp. 205–215.

    MathSciNet  MATH  Google Scholar 

  • A. Robinson 1963 On languages which are based on nonstandard integers, Nagoya Math. J. 22, pp. 83–117.

    Article  MathSciNet  MATH  Google Scholar 

  • C. SmoryƄski A Recursively saturated nonstandard models of arithmetic, to appear in JSL.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Leszek Pacholski Jedrzej Wierzejewski Alec J. Wilkie

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

SmoryƄski, C., Stavi, J. (1980). Cofinal extension preserves recursive saturation. 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/BFb0090172

Download citation

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

  • 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

Publish with us

Policies and ethics