An almost deep degree
From MaRDI portal
Publication:2747726
DOI10.2307/2695051zbMath0992.03049MaRDI QIDQ2747726
Theodore A. Slaman, Peter A. Cholak, Marcia J. Groszek
Publication date: 5 September 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2695051
03D25: Recursively (computably) enumerable sets and degrees
Related Items
STRONG JUMP-TRACEABILITY, A hierarchy for the plus cupping Turing degrees, A join theorem for the computably enumerable degrees, CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES, Elementary differences among jump classes, Joining to high degrees via noncuppables, Lowness properties and randomness, Randomness and Computability: Open Questions, Joining to High Degrees
Cites Work