A characterization of determinacy for Turing degree games

DOI10.4064/fm-80-3-287-291zbMath0276.02047OpenAlexW771348580MaRDI QIDQ4401447

Eugene M. Kleinberg

Publication date: 1973

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/214617

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Descriptive set theory (03E15) Large cardinals (03E55) Other combinatorial set theory (03E05) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items

A game-theoretic equivalence to the Hahn-Banach theorem