No CrossRef data available.
Article contents
Recursively saturated nonstandard models of arithmetic; addendum
Published online by Cambridge University Press: 12 March 2014
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0022481200043930/resource/name/firstPage-S0022481200043930a.jpg)
- Type
- Addendum
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1982
References
REFERENCES
[1]Friedman, H., Iterated inductive definitions and
, Intuitionism and proof theory (Kino, A., Myhill, J. and Vesley, R., Editors), North-Holland, Amsterdam, 1970.Google Scholar
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151027032548037-0937:S0022481200043930_inline02.gif?pub-status=live)
[3]Kotlarski, H., On elementary recursively saturated cuts in models of PA. III (to appear).Google Scholar
[5]Schmerl, J., Recursively saturated, rather classless models of Peano arithmetic, Logic year 1979–80 (Lerman, M., Schmerl, J. and Shore, R., Editors), Spring-Verlag, Heidelberg, 1981.Google Scholar
[6]Smoryński, C., Cofinal extensions of nonstandard models of arithmetic, Notre Dame Journal of Formal Logic, vol. 22 (1981), pp. 133–144.CrossRefGoogle Scholar