Prioric games and minimal degrees below 0^{(1)}

DOI10.4064/FM-82-3-217-237MaRDI QIDQ4052104zbMATH OpenOpenAlexFDO

Authors C. E. M. Yates

Publication date 1974

Published in Fundamenta Mathematicae (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(4)

• Lower bounds on degrees of game-theoretic structures
• A game-theoretic equivalence to the Hahn-Banach theorem
• Minimal Covers and Hyperdegrees
• Recursively enumerable sets and degrees

This page was built for publication: Prioric games and minimal degrees below $0^{(1)}$

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