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:

    All we know
    Is that we are a little early, that
    Today has that special, lapidary
    Todayness that the sunlight reproduces
    Faithfully in casting twig-shadows on blithe
    Sidewalks. No previous day would have been like this.
    John Ashbery (b. 1927)

    It is perhaps the principal admirableness of the Gothic schools of architecture, that they receive the results of the labour of inferior minds; and out of fragments full of imperfection ... raise up a stately and unaccusable whole.
    John Ruskin (1819–1900)