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

DOI10.4064/fm-82-3-217-237zbMath0298.02042OpenAlexW1007476460MaRDI QIDQ4052104

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)

Related Items (4)

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

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