An almost deep degree

DOI10.2307/2695051MaRDI QIDQ2747726zbMATH OpenOpenAlexFDO

Authors Peter A. Cholak, Theodore A. Slaman, Marcia Groszek

Publication date 5 September 2002

Published in The 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)

Recommendations

• A Matter of Degree
• On very high degrees
• Feasible Depth
• scientific article; zbMATH DE number 1489839
• Depth, highness and DNR degrees
• Depth, highness and DNR degrees
• Strong depth relevance
• scientific article; zbMATH DE number 3966267
• The Almost Lindelöf Degree
• Relativized depth

Cites work

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

Cited in

(12)

• Joining to high degrees via noncuppables
• A join theorem for the computably enumerable degrees
• Elementary differences among jump classes
• Joining to High Degrees
• The Degree of the Dormant Operatic Locus
• Randomness and Computability: Open Questions
• A high strongly noncappable degree
• A hierarchy for the plus cupping Turing degrees
• A limit on relative genericity in the recursively enumerable sets
• Strong jump-traceability
• Lowness properties and randomness
• Cupping and jump classes in the computably enumerable degrees

This page was built for publication: An almost deep degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747726)