Effective domination and the bounded jump
From MaRDI portal
Publication:778723
DOI10.1215/00294527-2020-0005zbMath1461.03035OpenAlexW3015586909MaRDI QIDQ778723
Publication date: 20 July 2020
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1586224879
Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Abelian \(p\)-groups and the halting problem
- Bounded low and high sets
- A bounded jump for the bounded Turing degrees
- Limits on jump inversion for strong reducibilities
- TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
- A Hierarchy of Turing Degrees
- Computational aspects of the hyperimmune-free degrees