Mathematical logic and foundations Descriptive set theory Concept
Determinacy
Summary
Determinacy is the property of an infinite two-player game of perfect information that one of the two players has a winning strategy. In the games of descriptive set theory, the players alternately choose natural numbers forever. The first player wins when the resulting sequence lies in a fixed payoff set. Gale and Stewart proved that games with an open or a closed payoff set are determined. The Borel determinacy theorem extends this to all Borel payoff sets. Stronger determinacy hypotheses, such as projective determinacy and the axiom of determinacy, imply strong regularity properties of sets of reals.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | QXECDPAYTN |
|---|---|
| URI | m2://QXECDPAYTN |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03E60, 91A44, 03E15 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.