Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2025-01-05T14:26:39.099Z Has data issue: false hasContentIssue false
  • English
  • Français

Recursively saturated nonstandard models of arithmetic; addendum

Published online by Cambridge University Press:  12 March 2014

C. Smoryński
C. Smoryński*
Affiliation:
429 s. Warwick, Westmont, Illinois 60559
Get access Rights & Permissions [Opens in a new window]

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.'
Type
Addendum
Information
The Journal of Symbolic Logic , Volume 47 , Issue 3 , September 1982 , pp. 493 - 494
Copyright
Copyright © Association for Symbolic Logic 1982

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

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
[2]Kossak, R., A certain class of models of Peano arithmetic (to appear).Google Scholar
[3]Kotlarski, H., On elementary recursively saturated cuts in models of PA. III (to appear).Google Scholar
[4]Quinsey, J., Some problems in logic, dissertation, Oxford, 1980.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