Solution to a Problem of Spector

DOI10.4153/CJM-1971-024-7MaRDI QIDQ3214910zbMATH OpenFDO

Authors Alistair H. Lachlan

Publication date 1971

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1971-024-7

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(9)

• Automorphism bases for degrees of unsolvability
• Quasi-minimal enumeration degrees and minimal Turing degrees
• Diagonally non-computable functions and bi-immunity
• Strong reducibilities
• Banach–Mazur games, comeager sets and degrees of unsolvability
• Local Initial Segments of The Turing Degrees
• A DNC function that computes no effectively bi-immune set
• Π₁¹ relations and paths through
• A dual form of Erdős-Rado's canonization theorem

This page was built for publication: Solution to a Problem of Spector

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