CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY

DOI10.1017/jsl.2017.15zbMath1419.03048OpenAlexW2711737084MaRDI QIDQ4977218

Sherwood Hachtman

Publication date: 3 August 2017

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1ed168677c6fbf45310cab6f5dbb5b7f3307c606

zbMATH Keywords

reflectionadmissible setsBorel determinacyinductive definability

Mathematics Subject Classification ID

Descriptive set theory (03E15) Inner models, including constructibility, ordinal definability, and core models (03E45) Second- and higher-order arithmetic and fragments (03F35) Determinacy principles (03E60)

Related Items (4)

Determinacy in third order arithmetic ⋮ Determinacy separations for class games ⋮ The strength of compactness in computability theory and nonstandard analysis ⋮ Uniformity, universality, and computability theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strict determinateness of certain infinite games
• Weak axioms of determinacy and subsystems of analysis. II \((\Sigma ^ 0_ 2\) games)
• Complexity of winning strategies
• Weak systems of determinacy and arithmetical quasi-inductive definitions
• Fine Structure
• The limits of determinacy in second-order arithmetic
• Ordinal Definability and Recursion Theory The Cabal Seminar Volume III
• Π¹₂ monotone inductive definitions
• Higher set theory and mathematical practice
• The fine structure of the constructible hierarchy

This page was built for publication: CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY