The following pages link to Double jumps of minimal degrees (Q4198741):
Displayed 18 items.
- 2-minimality, jump classes and a note on natural definability (Q386644) (← links)
- 1-generic degrees and minimal degrees in higher recursion theory. II (Q581398) (← links)
- There is no ordering on the classes in the generalized high/low hierarchies (Q818520) (← links)
- Degrees which do not bound minimal degrees (Q1073789) (← links)
- Upper bounds for the arithmetical degrees (Q1086229) (← links)
- A non-inversion theorem for the jump operator (Q1111549) (← links)
- Automorphism bases for degrees of unsolvability (Q1164625) (← links)
- Degrees of Dowd-type generic oracles (Q1854543) (← links)
- Multiple genericity: a new transfinite hierarchy of genericity notions (Q2089803) (← links)
- Generics for computable Mathias forcing (Q2453068) (← links)
- 1-generic splittings of computably enumerable degrees (Q2576946) (← links)
- A 2-MINIMAL NON-GL<sub>2</sub> DEGREE (Q3094352) (← links)
- Decidability and Invariant Classes for Degree Structures (Q3487331) (← links)
- Joining up to the generalized high degrees (Q3581116) (← links)
- Local Initial Segments of The Turing Degrees (Q4432542) (← links)
- A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES (Q4637942) (← links)
- Array nonrecursiveness and relative recursive enumerability (Q5388716) (← links)
- Domination, forcing, array nonrecursiveness and relative recursive enumerability (Q5388717) (← links)