Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-25T18:27:47.204Z Has data issue: false hasContentIssue false
  • English
  • Français

Remarks on weak notions of saturation in models of Peano arithmetic

Published online by Cambridge University Press:  12 March 2014

Matt Kaufmann  and
James H. Schmerl
Matt Kaufmann
Affiliation:
Austin Research Center, Burroughs Corporation, Austin, Texas 78727
James H. Schmerl
Affiliation:
Department of Mathematics, University of Connecticut, Storrs, Connecticut 06268
Get access Rights & Permissions [Opens in a new window]

Extract

This paper is a sequel to our earlier paper [2] entitled Saturation and simple extensions of models of Peano arithmetic. Among other things, we will answer some of the questions that were left open there. In §1 we consider the question of whether there are lofty models of PA which have no recursively saturated, simple extensions. We are still unable to answer this question; but we do show in that section that these models are precisely the lofty models which are not recursively saturated and which are κ-like for some regular κ. In §2 we use diagonal methods to produce minimal models of PA in which the standard cut is recursively definable, and other minimal models in which the standard cut is not recursively definable. In §3 we answer two questions from [2] by exhibiting countable models of PA which, in the terminology of this paper, are uniformly ω-lofty but not continuously ω-lofty and others which are continuously ω-lofty but not recursively saturated. We also construct a model (assuming ◇) which is not recursively saturated but every proper, simple cofinal extension of which is ℵ1-saturated. Finally, in §4 we answer another question from [2] by proving that for regular κ ≥ ℵ1; every κ-saturated model of PA has a κ-saturated proper, simple extension which is not κ +-saturated.

Our notation and terminology are quite standard. Anything unfamiliar to the reader and not adequately denned here is probably defined in §1 of [2]. All models considered are models of Peano arithmetic.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 52 , Issue 1 , March 1987 , pp. 129 - 148
Copyright
Copyright © Association for Symbolic Logic 1987

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.)

Footnotes

1

Partially supported by NSF grant no. MCS-8301603.

References

REFERENCES

[1] Chang, C.C. and Keisler, H. J., Model theory, 2nd ed., North-Holland, Amsterdam, 1977.Google Scholar
[2] Kaufmann, M. and Schmerl, J., Saturation and simple extensions of models of Peano arithmetic, Annals of Pure and Applied Logic, vol. 27 (1984), pp. 109–136.CrossRefGoogle Scholar
[3] Kirby, L. A. S., Initial segments of models of arithmetic, Dissertation, University of Manchester, Manchester, 1977.Google Scholar
[4] Kotlarski, H., On cofinal extensions of models of arithmetic, this Journal, vol. 48 (1983), pp. 253–262.Google Scholar
[5] Kotlarski, H., Satisfaction classes and bounded induction (preprint).Google Scholar
[6] Kotlarski, H., Krajewski, S. and Lachlan, A. H., Construction of satisfaction classes for nonstandard models, Canadian Mathematical Bulletin, vol. 24 (1981), pp. 283–293.CrossRefGoogle Scholar
[7] Krajewski, S., Nonstandard satisfaction classes, Set theory and hierarchy theory ( a memorial tribute to Andrzej Mostomki; proceedings of the second conference held at Bierutowice, 1975 ; Marek, W. et al., editors), Lecture Notes in Mathematics, vol. 537, Springer-Verlag, Heidelberg, 1976, pp. 121–144.Google Scholar
[8] Kreisel, G. and Levy, A., Reflection principles and their use for establishing the complexity of axiomatic systems, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 97–191.CrossRefGoogle Scholar
[9] Lachlan, A. H., Full satisfaction classes and recursive saturation, Canadian Mathematical Bulletin, vol. 24 (1981), pp. 295–297.CrossRefGoogle Scholar
[10] Lessan, H., Models of arithmetic, Dissertation, University of Manchester, Manchester, 1978.Google Scholar
[11] Schmerl, J. H., Recursively saturated, rather classless model of Peano arithmetic, Logic year 1979-80 (Lerman, M. et al., editors), Lecture Notes in Mathematics, vol. 859, Springer-Verlag, Heidelberg, 1981, pp. 268–282.CrossRefGoogle Scholar
[12] Shelah, S., Classification theory and the number of nonisomorphic models, North-Holland, Amsterdam, 1978.Google Scholar
[13] Smoryński, C., The incompleteness theorem, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1978, pp. 821–865.Google Scholar
[14] Smoryński, C. and Stavi, J., Cofinal extension preserves recursive saturation, Model theory of algebra and arithmetic ( Proceedings, Karpacz, 1979 ; Pacholski, L. et al., editors), Lecture Notes in Mathematics, vol. 834, Springer-Verlag, 1980, pp. 338–345.CrossRefGoogle Scholar