A Hierarchy of Turing Degrees
From MaRDI portal
Recommendations
- Hierarchy of Computably Enumerable Degrees II
- A hierarchy of computably enumerable degrees
- Turing degrees in refinements of the arithmetical hierarchy
- The search for natural definability in the Turing degrees
- Turing degrees and the Ershov hierarchy
- Turing Definability in the Ershov Hierarchy
- On relative enumerability of Turing degrees
- A hierarchy of Turing degrees of divergence bounded computable real numbers
- On the problem of definability of the computably enumerable degrees in the difference hierarchy
- Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
Cited in
(15)- Multiple genericity: a new transfinite hierarchy of genericity notions
- Separating weak -change and -change genericity
- Turing reducibility in the fine hierarchy
- Bounded low and high sets
- Hierarchy of Computably Enumerable Degrees II
- Computable Structure Theory
- Nonlowness is independent from fickleness
- Minimal weak truth table degrees and computably enumerable Turing degrees
- Maximality and collapse in the hierarchy of -c.a. degrees
- Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees
- Iterated priority arguments in descriptive set theory
- How to approximate fuzzy sets: mind-changes and the Ershov hierarchy
- On quasi-reducibility for c.e. sets. I: The structure of the Q-degrees and the sQ-degrees
- Notes on Sacks' splitting theorem
- Effective domination and the bounded jump
This page was built for publication: A Hierarchy of Turing Degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220017)
