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

DOI10.2307/2273183MaRDI QIDQ3882445zbMATH OpenOpenAlexFDO

Authors 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

exact pairidealjumpordinalTuring degree

Mathematics Subject Classification ID

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

Cites work

• Gaps in the contructable universe
• scientific article; zbMATH DE number 3289430 (Why is no real title available?)

Cited in

(9)

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

This page was built for publication: Jumping through the transfinite: the master code hierarchy of Turing degrees

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