Author： Giorgi Matthew B.
Publisher： Springer Publishing Company
ISSN： 0933-5846
Source： Archive for Mathematical Logic, Vol.43, Iss.1, 2004-01, pp. : 121-139
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We prove that every non-computable incomplete computably enumerable degree is locally non-cappable, and use this result to show that there is no maximal non-bounding computably enumerable degree.
Related content
Decomposition and infima in the computably enumerable degrees
The Journal of Symbolic Logic, Vol. 68, Iss. 2, 2003-06 ,pp. :
Access to resources
Recommend
Bounding minimal degrees by computably enumerable degrees
The Journal of Symbolic Logic, Vol. 63, Iss. 4, 1998-12 ,pp. :
A jump class of noncappable degrees
The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. :