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:
“New York has never learnt the art of growing old by playing on all its pasts. Its present invents itself, from hour to hour, in the act of throwing away its previous accomplishments and challenging the future. A city composed of paroxysmal places in monumental reliefs.”
—Michel de Certeau (1925–1986)
““The ideal reasoner,” he remarked, “would, when he had once been shown a single fact in all its bearings, deduce from it not only all the chain of events which led up to it but also all the results which would follow from it.””
—Sir Arthur Conan Doyle (1859–1930)