Physical Sciences and Mathematics Commons^™

Equivalences Of Determinacy Between Levels Of The Borel Hierarchy And Long Games, And Some Generalizations, Katherine Aimee Yost

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis will be 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 equivalence between determinacy of open games in a long tree, [Υ^α], and determinacy of Σ_0^α games in X^ω. In Chapter 9, we mimic the proof used in our main theorem to show that the determinacy of clopen games in the product space X^ω × ω^ω is equivalent …