Jumping through the transfinite: the master code hierarchy of Turing degrees
From MaRDI portal
Cites work
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)