Publisher： Cambridge University Press
E-ISSN： 1943-5886|72|4|1405-1417
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.72, Iss.4, 2007-12, pp. : 1405-1417
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 and nonbounding minimal pairs in the enumeration degrees
The Journal of Symbolic Logic, Vol. 70, Iss. 3, 2005-09 ,pp. :
Access to resources
Recommend
Generalized nonsplitting in the recursively enumerable degrees
The Journal of Symbolic Logic, Vol. 62, Iss. 2, 1997-06 ,pp. :
1-genericity in the enumeration degrees
The Journal of Symbolic Logic, Vol. 53, Iss. 3, 1988-09 ,pp. :
On minimal pairs of enumeration degrees
The Journal of Symbolic Logic, Vol. 50, Iss. 4, 1985-12 ,pp. :
Bounding minimal degrees by computably enumerable degrees
The Journal of Symbolic Logic, Vol. 63, Iss. 4, 1998-12 ,pp. :