Concepedia

Cone Determinacy

Cone Determinacy is a determinacy axiom asserting that for every set of reals closed under Turing equivalence and containing a cone in the Turing degrees, the associated two-player game on integers has a winning strategy for one of the players.

1

Publications

10

Citations

2

Authors

1

Institutions

Publications per year

2017–2026

1

Parents

Publications

1

1–1 of 1

Authors

2

  1. BM
    Bert M. Cregg

    Michigan State University, United States

    1 publications · 10 citations

    1

    h-index

  2. BC
    Brent Crain

    Michigan State University, United States

    1 publications · 10 citations

    1

    h-index

1–2 of 2

Institutions

1

  1. Michigan State University

    East Lansing, United States

    1 h-index

    2 publications

    20 citations

1–1 of 1

Venues

  1. Forest Science

    1 publications · 10 citations

    1

    h-index

1–1