Bounding cappable degrees

DOI10.1007/S001530050152MaRDI QIDQ1576591zbMATH OpenOpenAlexFDO

Authors Angsheng Li

Publication date 7 October 2001

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001530050152

zbMATH Keywords

Turing degreesTuring reducibilityminimal pairsrecursively enumerable degreescappable degrees

Mathematics Subject Classification ID

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

Recommendations

• Publication:3028997
• scientific article; zbMATH DE number 468962
• Complementing cappable degrees in the difference hierarchy.

Cited in

(10)

• Extending the Cooper minimal pair theorem
• Complementing cappable degrees in the difference hierarchy.
• scientific article; zbMATH DE number 4016885 (Why is no real title available?)
• scientific article; zbMATH DE number 468962 (Why is no real title available?)
• A high strongly noncappable degree
• scientific article; zbMATH DE number 5354050 (Why is no real title available?)
• On a conjecture of Lempp
• Continuity of capping in \(\mathcal C_{\text{bT}}\)
• The computably enumerable degrees are locally non-cappable
• A hierarchy for cuppable degrees

This page was built for publication: Bounding cappable degrees

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