Publisher： Cambridge University Press
E-ISSN： 1943-5886|70|3|741-766
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.70, Iss.3, 2005-09, pp. : 741-766
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
On minimal pairs of enumeration degrees
The Journal of Symbolic Logic, Vol. 50, Iss. 4, 1985-12 ,pp. :
Access to resources
Recommend
Bounding nonsplitting enumeration degrees
The Journal of Symbolic Logic, Vol. 72, Iss. 4, 2007-12 ,pp. :
The Journal of Symbolic Logic, Vol. 44, Iss. 4, 1979-12 ,pp. :
Bounding minimal degrees by computably enumerable degrees
The Journal of Symbolic Logic, Vol. 63, Iss. 4, 1998-12 ,pp. :
Jumps of quasi-minimal enumeration degrees
The Journal of Symbolic Logic, Vol. 50, Iss. 3, 1985-09 ,pp. :