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

Authors

24

  1. ES
    Eran Shmaya

    Northwestern University, United States

    2 publications · 44 citations

    2

    h-index

  2. AL
    Alain Louveau

    Sorbonne Université, France

    2 publications · 41 citations

    2

    h-index

  3. AD
    Andrew Du Plessis

    Aarhus University, Denmark

    2 publications · 72 citations

    2

    h-index

  4. TG
    Terence Gaffney

    Northeastern University, United States

    1 publications · 21 citations

    1

    h-index

  5. LH
    Leo Harrington

    University of California, Berkeley, United States

    1 publications · 197 citations

    1

    h-index

1–5 of 24

Venues

  1. Journal of Symbolic Logic

    3 publications · 260 citations

    3

    h-index

  2. Inventiones mathematicae

    2 publications · 72 citations

    2

    h-index

  3. Letters in Mathematical Physics

    1 publications · 13 citations

    1

    h-index

  4. Theoretical Computer Science

    1 publications · 26 citations

    1

    h-index

  5. CaltechAUTHORS (California Institute of Technology)

    Repository · 1 publications · 34 citations

    1

    h-index

1–5