Publisher： Cambridge University Press
E-ISSN： 1943-5886|63|4|1319-1347
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.63, Iss.4, 1998-12, pp. : 1319-1347
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
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
The computably enumerable degrees are locally non-cappable
Archive for Mathematical Logic, Vol. 43, Iss. 1, 2004-01 ,pp. :
A minimal pair of recursively enumerable degrees
The Journal of Symbolic Logic, Vol. 31, Iss. 2, 1966-06 ,pp. :