Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Borel Determinacy"”.

  1. 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 …

    unt Repository record for Borel Determinacy and Metamathematics (opens in a new tab)

  2. Equivalences of Determinacy Between Levels of the Borel Hierarchy and Long Games, and Some Generalizations

    … primarily focused on directly proving that the determinacy of Borel games in X^ω is equivalent to the determinacy of certain long open games, from a fragment of ZFC that’s well-known to be insufficient to prove Borel determinacy. The main theorem is a level by level result which shows the …

    unlv Repository record for Equivalences of Determinacy Between Levels of the Borel Hierarchy and Long Games, and Some Generalizations (opens in a new tab) Download PDF for Equivalences of Determinacy Between Levels of the Borel Hierarchy and Long Games, and Some Generalizations (opens in a new tab)

  3. Pi-1-1-determinacy and Sharps

    The study of games, and the determinacy thereof, has become incredibly important in modern day set theory. Modern work on the inner model program grew out of the wonderful connection between determinacy, descriptive set theory, large cardinals, and the structure of L-like models that can …

    boise Repository record for Pi-1-1-determinacy and Sharps (opens in a new tab)