Publisher： Cambridge University Press
E-ISSN： 1943-5886|51|1|130-134
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.51, Iss.1, 1986-03, pp. : 130-134
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We investigate the set
Related content
Nonhemimaximal degrees and the high/low hierarchy
The Journal of Symbolic Logic, Vol. 77, Iss. 2, 2012-06 ,pp. :
Access to resources
Recommend
A hierarchy for the plus cupping Turing degrees
The Journal of Symbolic Logic, Vol. 68, Iss. 3, 2003-09 ,pp. :
A hierarchy of families of recursively enumerable degrees
The Journal of Symbolic Logic, Vol. 49, Iss. 4, 1984-12 ,pp. :
Some contrasts between degrees and the arithmetical hierarchy
The Journal of Symbolic Logic, Vol. 36, Iss. 2, 1971-06 ,pp. :
Properly
The Journal of Symbolic Logic, Vol. 71, Iss. 4, 2006-12 ,pp. :