Publisher： Cambridge University Press
E-ISSN： 1943-5886|77|1|133-158
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.77, Iss.1, 2012-03, pp. : 133-158
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
Access to resources
Recommend
A hierarchy for the plus cupping Turing degrees
The Journal of Symbolic Logic, Vol. 68, Iss. 3, 2003-09 ,pp. :
Definability in the Recursively Enumerable Degrees
Bulletin of Symbolic Logic, Vol. 2, Iss. 4, 1996-12 ,pp. :
1-genericity in the enumeration degrees
The Journal of Symbolic Logic, Vol. 53, Iss. 3, 1988-09 ,pp. :
Bounding nonsplitting enumeration degrees
The Journal of Symbolic Logic, Vol. 72, Iss. 4, 2007-12 ,pp. :