| Display title | Borel determinacy theorem |
| Default sort key | Borel determinacy theorem |
| Page length (in bytes) | 14,317 |
| Namespace ID | 0 |
| Page ID | 241877 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>MedAI |
| Date of page creation | 20:09, 8 February 2024 |
| Latest editor | imported>MedAI |
| Date of latest edit | 20:09, 8 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In descriptive set theory, the Borel determinacy theorem states that any Gale–Stewart game whose payoff set is a Borel set is determined, meaning that one of the two players will have a winning strategy for the game. A Gale–Stewart game is a possibly infinite two-player game, where both players have... |
