The following pages link to A Hierarchy of Turing Degrees (Q5220017):
Displaying 11 items.
- Effective domination and the bounded jump (Q778723) (← links)
- Multiple genericity: a new transfinite hierarchy of genericity notions (Q2089803) (← links)
- Separating weak \(\alpha\)-change and \(\alpha\)-change genericity (Q2140582) (← links)
- Turing reducibility in the fine hierarchy (Q2187259) (← links)
- Bounded low and high sets (Q2402957) (← links)
- Hierarchy of Computably Enumerable Degrees II (Q3380356) (← links)
- Nonlowness is independent from fickleness (Q5037206) (← links)
- Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees (Q5113922) (← links)
- Maximality and collapse in the hierarchy of α-c.a. degrees (Q5859843) (← links)
- Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees (Q6119790) (← links)
- Iterated priority arguments in descriptive set theory (Q6636685) (← links)
