Borel Determinacy Theorem - Previous Results

Previous Results

Gale and Stewart (1953) proved that if the payoff set is an open or closed subset of Aω then the Gale–Stewart game with that payoff set is always determined. Over the next twenty years, this was extended to slightly higher levels of the Borel hierarchy through ever more complicated proofs. This led to the question of whether the game must be determined whenever the payoff set is a Borel subset of Aω. It was known that, using the axiom of choice, it is possible to construct a subset of {0,1}ω that is not determined (Kechris 1995, p. 139).

Harvey Friedman (1971) proved that that any proof that all Borel subsets of Cantor space ({0,1}ω ) were determined would require repeated use of the axiom of replacement, an axiom not typically required to prove theorems about "small" objects such as Cantor space.

Read more about this topic:  Borel Determinacy Theorem

Famous quotes containing the words previous and/or results:

    Those who govern, having much business on their hands, do not generally like to take the trouble of considering and carrying into execution new projects. The best public measures are therefore seldom adopted from previous wisdom, but forced by the occasion.
    Benjamin Franklin (1706–1790)

    The study and knowledge of the universe would somehow be lame and defective were no practical results to follow.
    Marcus Tullius Cicero (106–43 B.C.)