Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-22T20:33:35.976Z Has data issue: false hasContentIssue false
  • English
  • Français

Every analytic set is Ramsey

Published online by Cambridge University Press:  12 March 2014

Jack Silver
Jack Silver*
Affiliation:
University of California, Berkeley
Get access Rights & Permissions [Opens in a new window]

Extract

If X is a set, [Χ] ω will denote the set of countably infinite subsets of X. ω is the set of natural numbers. If S is a subset of [ω] ω , we shall say that S is Ramsey if there is some infinite subset X of ω such that either [Χ] ω ⊆ S or [Χ] ω ∩ S = 0. Dana Scott (unpublished) has asked which sets, in terms of logical complexity, are Ramsey.

The principal theorem of this paper is: Every Σ 1 1 (i.e., analytic) subset of [ω] ω is Ramsey (for the Σ, Π notations, see Addison [1]). This improves a result of Galvin-Prikry [2] to the effect that every Borel set is Ramsey. Our theorem is essentially optimal because, if the axiom of constructibility is true, then Gödel's Σ2 1 Π2 1 well-ordering of the set of reals [3], having the convenient property that the set of ω-sequences of reals enumerating initial segments is also Σ2 1 ∩ Π2 1, rather directly gives a Σ2 1 ∩ Π2 1 set which is not Ramsey. On the other hand, from the assumption that there is a measurable cardinal we shall derive the conclusion that every Σ 2 1 (i.e., PCA) is Ramsey. Also, we shall explore the connection between Martin's axiom and the Ramsey property.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 35 , Issue 1 , March 1970 , pp. 60 - 64
Copyright
Copyright © Association for Symbolic Logic 1970

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 work was partially supported by NSF contracts at the University of California, Berkeley.

References

[1] Addison, J. W., Separation principles in the hierarchies of classical and effective descriptive set theory, Fundamenta mathematicae, vol. 46 (1959), pp. 123–135.CrossRefGoogle Scholar
[2] Galvin, F. and Prikry, K. (to appear).Google Scholar
[3] Gödel, K., The consistency of the axiom of choice and of the generalized continuum hypothesis with the axioms of set theory, 4th ed., Princeton Univ Press, Princeton, N.J., 1958.Google Scholar
[4] Mathias, A. R. D., On a generalization of Ramsey's theorems, Notices of the American Mathematical Society, vol. 15 (1968), p. 931.Google Scholar
[5] Rowbottom, F., Doctoral dissertation, University of Wisconsin, Madison, Wis., 1964.Google Scholar
[6] Scott, D. and Solovay, R. M., Boolean-valued models of set theory, Proc. Sympos. Pure Math., vol. 13, Amer. Math. Soc., Providence, R.I. (to appear).Google Scholar
[7] Shoenfield, J., The problem of predicativity. Essays on the foundations of mathematics, Magnes Press, Jerusalem, 1961, pp. 226–233.Google Scholar
[8] Silver, J. H., The consistency of the generalized continuum hypothesis with the existence of a measurable cardinal, Notices of the American Mathematical Society, vol. 13 (1966), p. 721.Google Scholar
[9] Solovay, R. M., Σ2 1 subsets of R are Lebesgue measurable (to appear).Google Scholar
[10] Solovay, R. M. and Tennenbaum, S., Iterated Cohen extensions and Souslin's problem (to appear).Google Scholar