Banach–Mazur games, comeager sets and degrees of unsolvability

DOI10.1017/S0305004100052221zbMath0344.02033MaRDI QIDQ4111548

C. E. M. Yates

Publication date: 1976

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

A game-theoretic equivalence to the Hahn-Banach theorem ⋮ A General Framework for Priority Arguments ⋮ The degrees below a 1-generic degree < 0′ ⋮ On some filters and ideals of the Medvedev lattice ⋮ Automorphism bases for degrees of unsolvability ⋮ The Information Content of Typical Reals ⋮ Generic degrees are complemented ⋮ Recursively enumerable sets and degrees ⋮ Double jumps of minimal degrees ⋮ Degrees which do not bound minimal degrees

Cites Work

• Unnamed Item
• Category methods in recursion theory
• Initial segments of the degrees of unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• Solution to a Problem of Spector
• On initial segments of hyperdegrees
• Initial segments of the degrees of unsolvability Part II: minimal degrees