Finite level Borel games and a problem concerning the jump hierarchy

DOI10.2307/2274280zbMath0588.03027OpenAlexW2148520050MaRDI QIDQ3715102

Harold T. Hodes

Publication date: 1984

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

Full work available at URL: https://doi.org/10.2307/2274280

zbMATH Keywords

Turing degreeadmissible ordinal

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Borel determinacy
• Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy
• A degree-theoretic definition of the ramified analytical hierarchy
• Higher set theory and mathematical practice
• The fine structure of the constructible hierarchy

This page was built for publication: Finite level Borel games and a problem concerning the jump hierarchy