Publisher： Cambridge University Press
E-ISSN： 1943-5886|68|2|551-579
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.68, Iss.2, 2003-06, pp. : 551-579
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
Bounding minimal degrees by computably enumerable degrees
The Journal of Symbolic Logic, Vol. 63, Iss. 4, 1998-12 ,pp. :
Access to resources
Recommend
The computably enumerable degrees are locally non-cappable
Archive for Mathematical Logic, Vol. 43, Iss. 1, 2004-01 ,pp. :
Prime models of computably enumerable degree
The Journal of Symbolic Logic, Vol. 73, Iss. 4, 2008-12 ,pp. :