Cofinal extension preserves recursive saturation

  • C. Smoryński
  • J. Stavi
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 834)


Saturated Model Closure Property Peano Arithmetic Nonstandard Model Truth Definition 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. J. Barwise and J. Schlipf 1976 An introduction to recursively saturated and resplendent models, JSL 41, pp. 531–536.MathSciNetzbMATHGoogle Scholar
  2. 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
  3. 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
  4. 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
  5. H. Kotlarski A On elementary recursively saturated cuts in models of Peano arithmetic, to appear.Google Scholar
  6. H. Lesan 1978 Models of arithmetic, dissertation, Manchester.Google Scholar
  7. J. Paris and G. Mills 1979 Closure properties of countable non-standard integers, Fund. Math. 103, pp. 205–215.MathSciNetzbMATHGoogle Scholar
  8. A. Robinson 1963 On languages which are based on nonstandard integers, Nagoya Math. J. 22, pp. 83–117.MathSciNetCrossRefzbMATHGoogle Scholar
  9. C. Smoryński A Recursively saturated nonstandard models of arithmetic, to appear in JSL.Google Scholar

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • C. Smoryński
    • 1
  • J. Stavi
    • 1
  1. 1.Bar-Ilan UniversityIsrael

Personalised recommendations