Borel Determinacy
Borel Determinacy is a theorem in descriptive set theory asserting that every Borel game is determined, meaning that for every Borel subset of the Baire space, one of the two players has a winning strategy in the associated infinite two-player game of perfect information.
19
Publications
1.2K
Citations
24
Authors
17
Institutions
Publications per year
2017–2026
0
Parents
19
Analytic determinacy and 0<sup>#</sup>
Leo Harrington · Journal of Symbolic Logic · 1978 · 197 citations
An extension of borel determinacy
Donald A. Martin · Annals of Pure and Applied Logic · 1990 · 54 citations
1–5 of 19
24
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 24
17
Université Paris Cité
Paris, France
4 h-index
7 publications
156 citations

Sorbonne Université
Paris, France
3 h-index
6 publications
130 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
48 citations

Aarhus University
Aarhus, Denmark
2 h-index
3 publications
93 citations
University of California, Santa Barbara
Santa Barbara, United States
1 h-index
1 publications
21 citations
California Institute of Technology
Pasadena, United States
1 h-index
1 publications
53 citations

University of Toronto
Toronto, Canada
1 h-index
1 publications
10 citations
University of California, Los Angeles
Los Angeles, United States
1 h-index
1 publications
54 citations
1–8 of 17
3 publications · 260 citations
3
h-index
2 publications · 72 citations
2
h-index
1 publications · 13 citations
1
h-index
1 publications · 26 citations
1
h-index
Repository · 1 publications · 34 citations
1
h-index
1–5