Hostname: page-component-7bb8b95d7b-dtkg6 Total loading time: 0 Render date: 2024-09-26T07:52:30.235Z Has data issue: false hasContentIssue false
  • English
  • Français

A certain class of models of Peano arithmetic

Published online by Cambridge University Press:  12 March 2014

Roman Kossak
Roman Kossak*
Affiliation:
Institute for Applications of Mathematics and Statistics, Agricultural University of Warsaw, Warsaw, Poland
Get access Rights & Permissions [Opens in a new window]

Extract

This paper is devoted to the study of recursively and short recursively saturated models of PA by means of so-called nonstandard satisfaction methods. The paper is intended to be self-contained. In particular, no knowledge of nonstandard satisfaction classes is assumed. In fact we shall not use this notion explicitly.

We define a certain property of models of PA which we call the S-property and prove that properly short recursively saturated models (see Definition 2.1. below) are exactly short models with the S-property. The main result is that all properly short recursively saturated models are elementary cuts of recursively saturated models. This is a generalization to the uncountable case of the theorem of C. Smorynski [9] and is an easy application of some general results concerning cofinal extensions of models of PA which we discuss in §3.

On the way we obtain another proof of the result of Smorynski and Stavi [10] which says that short recursive and recursive saturation is preserved under cofinal extensions.

The author wants to thank H. Kotlarski and W. Marek for valuable suggestions concerning the subject of the paper.

Special thanks must also go to J. Paris for the lemma used in the proof of Theorem 3.5.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 48 , Issue 2 , June 1983 , pp. 311 - 320
Copyright
Copyright © Association for Symbolic Logic 1983

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]Dimitracopoulos, C., Ph. D. Dissertation, Manchester University, 1980.Google Scholar
[2]Gaifman, H., A note on models and submodels of arithmetic, Conference in Mathematical Logic-London '70, Lecture Notes in Mathematics, vol. 255, Springer-Verlag, Berlin and New York, 1972, pp. 128–144.Google Scholar
[3]Kaufmann, M., A rather classless model, Proceedings of the American Mathematical Society, vol. 62 (1977), pp. 330–333.CrossRefGoogle Scholar
[4]Kotlarski, H., On cofinal extensions of models of arithmetic, this Journal, vol. 48 (1983), pp. 253–262.Google Scholar
[5]Lessan, H., Ph. D. Dissertation, Manchester University, 1978.Google Scholar
[6]Paris, J. and Kirby, L., 2n-collection schemas in arithmetic, Logic Colloquium '77, North-Holland, Amsterdam, 1978.Google Scholar
[7]Phillips, R.G., Omitting types in arithmetic and conservative extensions, Victoria Symposium on Non-Standard Analysis '72, Lecture Notes in Mathematics, vol. 365, Springer-Verlag, Berlin and New York, 1974.Google Scholar
[8]Schmerl, J.H., Recursively saturated, rather classless models of Peano arithmetic, Logic year 1979–80, Lecture Notes in Mathematics, vol. 859, Springer-Verlag, Berlin and New York, 1981, pp. 268–282.CrossRefGoogle Scholar
[9]Smoryński, C., Recursively saturated nonstandard models of arithmetic, this Journal, vol. 46 (1981), pp. 259–286.Google Scholar
[10]Smoryński, C. and Stavi, J., Cofinal extension preserves recursive saturation, Model theory of algebra and arithmetic, Lecture Notes in Mathematics, vol. 834, Springer-Verlag, Berlin and New York, 1981.Google Scholar