Banach–Mazur games, comeager sets and degrees of unsolvability
From MaRDI portal
Publication:4111548
DOI10.1017/S0305004100052221zbMath0344.02033MaRDI QIDQ4111548
Publication date: 1976
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
The Information Content of Typical Reals, A General Framework for Priority Arguments, Generic degrees are complemented, On some filters and ideals of the Medvedev lattice, Degrees which do not bound minimal degrees, Automorphism bases for degrees of unsolvability, A game-theoretic equivalence to the Hahn-Banach theorem, The degrees below a 1-generic degree < 0′, Recursively enumerable sets and degrees, Double jumps of minimal degrees
Cites Work