Publisher： Cambridge University Press
E-ISSN： 1943-5886|64|3|1037-1064
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.64, Iss.3, 1999-09, pp. : 1037-1064
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
NON-SPLITTINGS OF SPEEDABLE SETS
The Journal of Symbolic Logic, Vol. 80, Iss. 2, 2015-04 ,pp. :
Access to resources
Recommend
Splittings of effectively speedable sets and effectively levelable sets
The Journal of Symbolic Logic, Vol. 69, Iss. 1, 2004-03 ,pp. :
Computational complexity, speedable and levelable sets
The Journal of Symbolic Logic, Vol. 42, Iss. 4, 1977-12 ,pp. :
On complexity properties of recursively enumerable sets
The Journal of Symbolic Logic, Vol. 38, Iss. 4, 1973-12 ,pp. :