Borel Determinacy and Metamathematics
Borel determinacy states that if G(T;X) is a game and X is Borel, then G(T;X) is determined. Proved by Martin in 1975, Borel determinacy is a theorem of ZFC set theory, and is, in fact, the best determinacy result in ZFC. However, the proof uses sets of high set theoretic type (N1 many power sets of...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
University of North Texas
2001
|
| Subjects: | |
| Online Access: | https://digital.library.unt.edu/ark:/67531/metadc3061/ |