An almost deep degree

DOI10.2307/2695051zbMath0992.03049OpenAlexW2143900969MaRDI 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

zbMATH Keywords

r.e. degreelow degreealmost deep degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

A join theorem for the computably enumerable degrees, STRONG JUMP-TRACEABILITY, Joining to High Degrees, A hierarchy for the plus cupping Turing degrees, Joining to high degrees via noncuppables, Elementary differences among jump classes, Randomness and Computability: Open Questions, Lowness properties and randomness, CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES

Cites Work

• The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations
• A limit on relative genericity in the recursively enumerable sets