Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T12:07:12.188Z Has data issue: false hasContentIssue false

Borel sets and Ramsey's theorem1

Published online by Cambridge University Press:  12 March 2014

Fred Galvin
Affiliation:
University of California, Los Angeles, California 90024
Karel Prikry
Affiliation:
University of Wisconsin, Madison, Wisconsin 53706

Extract

Definition 1. For a set S and a cardinal κ,

In particular, 2ω denotes the power set of the natural numbers and not the cardinal 2ℵ0. We regard 2ω as a topological space with the usual product topology.

Definition 2. A set S ⊆ 2ω is Ramsey if there is an M ∈ [ω]ω such that either [M]ω ⊆ S or else [M]ω ⊆ 2ω − S.

Erdös and Rado [3, Example 1, p. 434] showed that not every S ⊆ 2ω is Ramsey. In view of the nonconstructive character of the counterexample, one might expect (as Dana Scott has suggested) that all sufficiently definable sets are Ramsey. In fact, our main result (Theorem 2) is that all Borei sets are Ramsey. Soare [10] has applied this result to some problems in recursion theory.

The first positive result on Scott's problem was Ramsey's theorem [8, Theorem A]. The next advance was Nash-Williams' generalization of Ramsey's theorem (Corollary 2), which can be interpreted as saying: If S1 and S2 are disjoint open subsets of 2ω, there is an M ∈ [ω]ω such that either [M]ω ⋂ S1 = ∅ or [M]ω ∩ S2 = ⊆. (This is halfway between “clopen sets are Ramsey” and “open sets are Ramsey.”) Then Galvin [4] stated a generalization of Nash-Williams' theorem (Corollary 1) which says, in effect, that open sets are Ramsey; this was discovered independently by Andrzej Ehrenfeucht, Paul Cohen, and probably many others, but no proof has been published.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1973

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

Article purchase

Temporarily unavailable