Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-22T05:57:45.713Z Has data issue: false hasContentIssue false

Weakly compact cardinals in models of set theory

Published online by Cambridge University Press:  12 March 2014

Ali Enayat*
Affiliation:
Mathematics Department, University of Wisconsin, Madison, Wisconsin 53706
*
Department of Mathematics, Western Illinois University, Macomb, Illinois, 61455

Extract

The central notion of this paper is that of a κ-elementary end extension of a model of set theory. A model is said to be a κ-elementary end extension of a model of set theory if > and κ, which is a cardinal of , is end extended in the passage from to , i.e., enlarges κ without enlarging any of its members (see §0 for more detail). This notion was implicitly introduced by Scott in [Sco] and further studied by Keisler and Morley in [KM], Hutchinson in [H] and recently by the author in [E]. It is not hard to see that if has a κ-elementary end extension then κ must be regular in . Keisler and Morley [KM] noticed that this has a converse if is countable, i.e., if κ is a regular cardinal of a countable model then has a κ-elementary end extension. Later Hutchinson [H] refined this result by constructing κ-elementary end extensions 1 and 2 of an arbitrary countable model in which κ is a regular uncountable cardinal, such that 1 adds a least new element to κ while 2 adds no least new ordinal to κ. It is a folklore fact of model theory that the Keisler-Morley result gives soft and short proofs of countable compactness and abstract completeness (i.e. recursive enumera-bility of validities) of the logic L(Q), studied extensively in Keisler's [K2]; and Hutchinson's refinement does the same for stationary logic L(aa), studied by Barwise et al. in [BKM]. The proof of Keisler-Morley and that of Hutchinson make essential use of the countability of since they both rely on the Henkin-Orey omitting types theorem. As pointed out in [E, Theorem 2.12], one can prove these theorems using “generic” ultrapowers just utilizing the assumption of countability of the -power set of κ. The following result, appearing as Theorem 2.14 in [E], links the notion of κ-elementary end extension to that of measurability of κ. The proof using (b) is due to Matti Rubin.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1985

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

[AHKZ]Abramson, F. G., Harrington, L. A., Kleinberg, E. M. and Zwicker, W. S., Flipping properties: A unifying thread in the theory of large cardinals, Annals of Mathematical Logic, vol. 12 (1977), pp. 2558.CrossRefGoogle Scholar
[BKM]Barwise, J., Kaufmann, M. and Makkai, M., Stationary logic, Annals of Mathematical Logic, vol. 13 (1978), pp. 171224.CrossRefGoogle Scholar
[E]Enayat, A., On certain elementary extensions of models of set theory, Transactions of the American Mathematical Society, vol. 283 (1984), pp. 705715.CrossRefGoogle Scholar
[H]Hutchinson, J. E., Elementary extensions of countable models of set theory, this Journal, vol. 41 (1976), pp. 139145.Google Scholar
[Ka]Kaufmann, M., Blunt and topless end extensions of models of set theory, this Journal, vol. 48 (1983), pp. 10531073.Google Scholar
[K1]Keisler, H. J., Extending models of set theory (abstract), this Journal, vol. 30 (1965), p. 269.Google Scholar
[K2]Keisler, H. J., Logic with the quantifier “there exist uncountably many”, Annals of Mathematical Logic, vol. 1 (1970), pp. 194.CrossRefGoogle Scholar
[K3]Keisler, H. J., Models with tree structures, Proceedings of the Tarski Symposium, Proceedings of Symposia in Pure Mathematics, vol. 25, American Mathematical Society, Providence, Rhode Island, 1974, pp. 331348.CrossRefGoogle Scholar
[KM]Keisler, H. J. and Morley, M., Elementary extensions of models of set theory, Israel Journal of Mathematics, vol. 5 (1968), pp. 4965.CrossRefGoogle Scholar
[K1]Kleinberg, E. M., A combinatorial characterization of M-ultrafilters, Advances in Mathematics, vol. 30 (1978), pp. 7784.CrossRefGoogle Scholar
[Ku]Kunen, K., Inaccessibility properties of cardinals, Ph.D. Thesis, Stanford University, Stanford, California, 1968.Google Scholar
[Sch]Schmerl, J., 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. 268282.CrossRefGoogle Scholar
[Sco]Scott, D., Measurable cardinals and the constructible sets, Bulletin de l'Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques, vol. 9 (1961), pp. 521524.Google Scholar
[Sh]Shelah, S., Models with second order properties. II: Trees with no undefined branches, Annals of Mathematical Logic, vol. 14 (1978), pp. 7387.CrossRefGoogle Scholar