Bounding cappable degrees

DOI10.1007/S001530050152zbMATH Open0974.03039OpenAlexW2064745568MaRDI QIDQ1576591FDOQ1576591

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

Recommendations

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

zbMATH Keywords

Turing degreesTuring reducibilityminimal pairsrecursively enumerable degreescappable degrees

Mathematics Subject Classification ID

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

Cited In (10)

• Extending the Cooper minimal pair theorem
• Title not available (Why is that?)
• Complementing cappable degrees in the difference hierarchy.
• Title not available (Why is that?)
• A high strongly noncappable degree
• Title not available (Why is that?)
• On a conjecture of Lempp
• The computably enumerable degrees are locally non-cappable
• Continuity of capping in \(\mathcal C_{\text{bT}}\)
• 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)