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:

    The plot was most interesting. It belonged to no particular age, people, or country, and was perhaps the more delightful on that account, as nobody’s previous information could afford the remotest glimmering of what would ever come of it.
    Charles Dickens (1812–1870)

    Consider what you have in the smallest chosen library. A company of the wisest and wittiest men that could be picked out of all civil countries in a thousand years have set in best order the results of their learning and wisdom. The men themselves were hid and inaccessible, solitary, impatient of interruption, fenced by etiquette; but the thought which they did not uncover in their bosom friend is here written out in transparent words to us, the strangers of another age.
    Ralph Waldo Emerson (1803–1882)