Jumping through the transfinite: the master code hierarchy of Turing degrees

DOI10.2307/2273183zbMath0441.03014OpenAlexW1968792152MaRDI QIDQ3882445

Harold T. Hodes

Publication date: 1980

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273183

zbMATH Keywords

ordinalidealjumpTuring degreeexact pair

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items

A non-inversion theorem for the jump operator, Degree-theoretic bounds on the morley rank, The limits of determinacy in second order arithmetic: consistency and complexity strength, A classification of jump operators, European Summer Meeting of the Association for Symbolic Logic, Leeds, 1979, Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy, Effective randomness for continuous measures, Forcing and reductibilities. II. Forcing in fragments of analysis, Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

Cites Work

• Gaps in the contructable universe
• Unnamed Item