Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-25T03:39:05.505Z Has data issue: false hasContentIssue false
  • English
  • Français

Toward model theory through recursive saturation1

Published online by Cambridge University Press:  12 March 2014

John Stewart Schlipf
John Stewart Schlipf*
Affiliation:
California Institute of Technology, Pasadena CA 91125
Get access Rights & Permissions [Opens in a new window]

Extract

One of the most significant by-products of the study of admissible sets with urelements is the emphasis it has given to recursively saturated models. As suggested in [Schlipf, 1977], countable recursively saturated models (for finite languages) possess many of the desirable properties of saturated and special models. The notion of resplendency was introduced to isolate some of these desirable properties. In §§1 and 2 of this paper we study these parallels, showing how they can be exploited to give new proofs of some traditional model theoretic theorems. This yields both pedagogical and philosophical advantages: pedagogical since countable recursively saturated models are easier to build and manipulate than saturated and special models; philosophical since it shows that uncountable models — which the downward Lowenheim–Skolem theorem tells us are in some sense not basic in the study of countable theories — are not needed in model theoretic proofs of these theorems. In §3 we apply our local results to get results about resplendent models of ZF set theory and PA (Peano arithmetic). In §4 we shall examine certain analogous results for admissible languages, most similar to, and seemingly generally slightly weaker than, already known results. (The Chang–Makkai sort of result, however, is new.)

Although this paper is an outgrowth of work with admissible sets with urelements, I have tried to keep it as accessible as possible to those with a background only in finitary model theory. Thus §§1,2, and 3 should not involve any work with admissible sets. §4, however, is concerned with some admissible analogues to results in §2 and necessarily uses certain technical results of §11 5 of [Schlipf, 1977].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 43 , Issue 2 , June 1978 , pp. 183 - 206
Copyright
Copyright © Association for Symbolic Logic 1978

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

This paper is a revision of part of the author's Ph.D. thesis at the University of Wisconsin in Madison. The author is indebted to the logicians in Madison for help and inspiration, and particularly to Professor Jon Barwise, his thesis advisor. The preparation of this paper was partially supported by NSF grant MCS 76-17254.

References

REFERENCES

Barwise, J. [1975], Admissible sets and structures, Springer-Verlag, Berlin and New York.CrossRefGoogle Scholar
Barwise, J. and Schlipf, J. [1975], Recursively saturated models of Peano arithmetic, Model theory and algebra: A memorial tribute to Abraham Robinson (Saracino, D. H. and Weispfenning, V. B., Editors), Lecture Notes in Mathematics, no. 498, Springer-Verlag, Berlin, pp. 42–55.CrossRefGoogle Scholar
Barwise, J. and Schlipf, J. [1976], An introduction to recursively saturated and resplendent models, this Journal, vol. 41, pp. 531–536.Google Scholar
Chang, C. C. and Keisler, H. J. [1973], Model theory, North-Holland, Amsterdam.Google Scholar
Chang, C. C. and Moschovakis, Y. N. [1968], On Σ11-relations on special models, Notices of the American Mathematical Society, vol. 15, p. 934.Google Scholar
Friedman, H. [1973], Countable models of set theories, Cambridge Summer School in Mathematical Logic, Lecture Notes in Mathematics, no. 337, Springer-Verlag, Berlin, pp. 539–573.Google Scholar
Keisler, H. J. [1965], Finite approximations of infinitely long formulas, The theory of models (Addison, J., Henkin, L. and Tarski, A., Editors), North-Holland, Amsterdam, pp. 158–169.Google Scholar
Keisler, H. J. [1971], Model theory for infinitary logic, North-Holland, Amsterdam.Google Scholar
Kleene, S. C. [1952], Finite axiomatizability of theories in the predicate calculus.using additional predicate symbols, Two papers on the predicate calculus, Memoirs of the American Mathematical Society, no. 10, pp. 27–68.Google Scholar
Kueker, D. [1970], Generalized interpolation and definability, Annals of Mathematical Logic, vol. 1, pp. 423–468.CrossRefGoogle Scholar
Makkai, M. [1973], Global definability theory in Lω1ω, Bulletin of the American Mathematical Society, vol. 79, pp. 916–921.CrossRefGoogle Scholar
Nadel, M. [1971], Model theory in admissible sets, Ph.D. Thesis, University of Wisconsin.Google Scholar
Ressayre, J. P. [1972], Modéles booléens et langages du 1er order, Doctoral Thesis, University of Paris.Google Scholar
Ressayre, J. P. [ 1977], Models with compactness properties relative to an admissible language, Annals of Mathematical Logic, vol. 11, pp. 31–55.CrossRefGoogle Scholar
Reyes, G. E. [1970], Local definability theory, Annals of Mathematical Logic, vol. 1, pp. 95–137.CrossRefGoogle Scholar
Schlipf, J. [1975], Some hyperelementary aspects of model theory, Ph.D. Thesis, University of Wisconsin.Google Scholar
Schlipf, J. [1976], Recursively saturated models and the Chang-Makkai Theorem (abstract), this Journal, vol. 41, pp. 282–283.Google Scholar
Schlipf, J. [1977], A guide to the identification of admissible sets above structures, Annals of Mathematical Logic (to appear).Google Scholar
Svenonius, L. [1965], On the denumerable models of theories with extra predicates, The theory of models, North-Holland, Amsterdam, pp. 376–389.Google Scholar
van der Waerden, B. L. [1964], Modern algebra (translated by Fred Blum), Ungar, New York.Google Scholar