Publisher： Cambridge University Press
E-ISSN： 1943-5886|53|1|174-187
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.53, Iss.1, 1988-03, pp. : 174-187
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
A jump class of noncappable degrees
The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. :
Access to resources
Recommend
Bulletin of the Australian Mathematical Society, Vol. 93, Iss. 2, 2016-04 ,pp. :
The computably enumerable degrees are locally non-cappable
Archive for Mathematical Logic, Vol. 43, Iss. 1, 2004-01 ,pp. :
Noncappable enumeration degrees below
The Journal of Symbolic Logic, Vol. 61, Iss. 4, 1996-12 ,pp. :
Working below a high recursively enumerable degree
The Journal of Symbolic Logic, Vol. 58, Iss. 3, 1993-09 ,pp. :