Effective domination and the bounded jump
From MaRDI portal
Publication:778723
DOI10.1215/00294527-2020-0005zbMATH Open1461.03035OpenAlexW3015586909MaRDI QIDQ778723FDOQ778723
Authors: Keng Meng Ng, Hongyuan Yu
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
Recommendations
Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Title not available (Why is that?)
- Abelian \(p\)-groups and the halting problem
- Title not available (Why is that?)
- Computational aspects of the hyperimmune-free degrees
- TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- A hierarchy of computably enumerable degrees
- A bounded jump for the bounded Turing degrees
- Bounded low and high sets
- Limits on jump inversion for strong reducibilities
- A Hierarchy of Turing Degrees
Cited In (6)
This page was built for publication: Effective domination and the bounded jump
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778723)