Determinacy separations for class games

DOI10.1007/S00153-018-0655-YMaRDI QIDQ2312093zbMATH OpenOpenAlexWikidataFDO

Authors Sherwood Hachtman

Publication date 4 July 2019

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.05515

zbMATH Keywords

admissible set theoryconstructibilitydeterminacyhigher-order arithmeticset theory with classes

Mathematics Subject Classification ID

Determinacy principles (03E60) Nonclassical and second-order set theories (03E70) Second- and higher-order arithmetic and fragments (03F35)

Abstract: We show, assuming weak large cardinals, that in the context of games played in a proper class of moves, clopen determinacy is strictly weaker than open determinacy. The proof amounts to an analysis of a certain level of $L$ that exists under large cardinal assumptions weaker than an inaccessible. Our argument is sufficiently general to give a family of determinacy separation results applying in any setting where the universal class is sufficiently closed; e.g., in third, seventh, or $(omega+2)$th order arithmetic. We also prove bounds on the strength of Borel determinacy for proper class games. These results answer questions of Gitman and Hamkins.

Recommendations

• Open determinacy for class games
• Determinacy in L(ℝ)
• scientific article; zbMATH DE number 4072961
• The determinacy of long games
• GAMES OF LENGTH ω₁

Cites work

• CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY
• Determinacy in third order arithmetic
• Fine structure
• Higher set theory and mathematical practice
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• Introduction to mathematical logic
• Open determinacy for class games
• Set Theory
• The fine structure of the constructible hierarchy
• The limits of determinacy in second order arithmetic: consistency and complexity strength
• The limits of determinacy in second-order arithmetic
• Transfinite recursion in higher reverse mathematics

Cited in

(9)

• Determinacy and extended sharp functions on the reals. II: Obtaining sharps from determinacy
• Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives
• Determinacy in third order arithmetic
• Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results
• scientific article; zbMATH DE number 4072961 (Why is no real title available?)
• scientific article; zbMATH DE number 1956506 (Why is no real title available?)
• scientific article; zbMATH DE number 1390275 (Why is no real title available?)
• SHORTENING CLOPEN GAMES
• Open determinacy for class games

This page was built for publication: Determinacy separations for class games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2312093)