Skip to main content
SpringerLink
Log in

On recursively saturated models of arithmetic

  • Contributed Papers
  • Conference paper
  • First Online:
Model Theory and Algebra

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

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
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

  1. Barwise, K. J., Admissible Sets and Structures, to appear in Springer Verlag series “Perspectives in Mathematical Logic”.

    Google Scholar 

  2. Ehrenfeucht, A., and G. Kreisel, Strong Models of Arithmetic, Bull. de l'Acad. Polonaise des Sciences, XV (1966) pp. 107–110.

    MathSciNet  MATH  Google Scholar 

  3. Gandy, R. O., G. Kreisel, and Tait, W., Set existence, Bull. Acad. Polon. Ser. Sci. Math. Astron. Phys., 8 (1960) pp. 577–582.

    MathSciNet  MATH  Google Scholar 

  4. Moschovakis, Y., Predicative classes, Axiomatic set Theory, Part I, Amer. Math. Soc., (1971) pp. 247–264.

    Google Scholar 

  5. Moschovakis, Y., Elementary Induction on Abstract Structures, North Holland Publ. Amsterdam (1974).

    MATH  Google Scholar 

  6. Robinson, A., Metamathematical problems, J. Symbolic Logic, 38 (1973) pp. 500–516.

    Article  MathSciNet  MATH  Google Scholar 

  7. Schlipf, J. S., Some Hyperelementary Aspects of Model Theory, Doctoral Dissertation, The University of Wisconsin, in preparation.

    Google Scholar 

  8. Steal, J., Forcing with tagged trees (abstract), Notices of Amer. Math. Soc. 21 (1974) pp. A627–A628.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Wisconsin-Madison, USA

    Jon Barwise & John Schlipf

Authors
  1. Jon Barwise
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Schlipf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Daniel H. Saracino Volker B. Weispfenning

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Barwise, J., Schlipf, J. (1975). On recursively saturated models of arithmetic. In: Saracino, D.H., Weispfenning, V.B. (eds) Model Theory and Algebra. Lecture Notes in Mathematics, vol 498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0080973

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07538-7

  • Online ISBN: 978-3-540-38057-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation