Bounding minimal degrees by computably enumerable degrees
From MaRDI portal
Publication:4254684
DOI10.2307/2586653zbMath0935.03051MaRDI QIDQ4254684
Publication date: 29 June 1999
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2586653
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Degrees which do not bound minimal degrees
- Complementing below recursively enumerable degrees
- Handbook of computability theory
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- A minimal degree less than 0’
- The jump is definable in the structure of the degrees of unsolvability
- Degrees joining to 0′
- D.R.E. Degrees and the Nondiamond Theorem
- Initial segments of degrees below 0′
- Minimal degrees of unsolvability and the full approximation construction
- Simple Proofs of Some Theorems on High Degrees of Unsolvability
- A theorem on minimal degrees
- Initial segments of the degrees of unsolvability Part II: minimal degrees