Recommendations
Cites work
- scientific article; zbMATH DE number 4172959 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- A Hierarchy of Turing Degrees
- A bounded jump for the bounded Turing degrees
- A hierarchy of computably enumerable degrees
- Abelian \(p\)-groups and the halting problem
- Bounded low and high sets
- Computational aspects of the hyperimmune-free degrees
- Limits on jump inversion for strong reducibilities
- TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
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)