A characterization of determinacy for Turing degree games

DOI10.4064/FM-80-3-287-291zbMATH Open0276.02047OpenAlexW771348580MaRDI QIDQ4401447FDOQ4401447

Authors: 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) Hierarchies of computability and definability (03D55) Other combinatorial set theory (03E05) Descriptive set theory (03E15) Large cardinals (03E55) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (1)

• A game-theoretic equivalence to the Hahn-Banach theorem

This page was built for publication: A characterization of determinacy for Turing degree games

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