The computably enumerable degrees are locally non-cappable

DOI10.1007/S00153-003-0187-XzbMATH Open1059.03036OpenAlexW2030987112MaRDI QIDQ1879005FDOQ1879005

Matthew B. Giorgi

Publication date: 22 September 2004

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

Full work available at URL: https://doi.org/10.1007/s00153-003-0187-x

Recommendations

• Highness and local noncappability
• Highness, locally noncappability and nonboundings
• Noncappable enumeration degrees below 0_e^′
• Strong noncuppability in low computably enumerable degrees
• Bounding cappable degrees

zbMATH Keywords

maximalcomputably enumerable degreecappablelink/listnon-bounding

Mathematics Subject Classification ID

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

Cited In (2)

• The computable Lipschitz degrees of computably enumerable sets are not dense
• Continuity of capping in \(\mathcal C_{\text{bT}}\)

This page was built for publication: The computably enumerable degrees are locally non-cappable

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