Publisher： Cambridge University Press
E-ISSN： 1943-5886|69|1|143-158
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.69, Iss.1, 2004-03, pp. : 143-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
NON-SPLITTINGS OF SPEEDABLE SETS
The Journal of Symbolic Logic, Vol. 80, Iss. 2, 2015-04 ,pp. :
Access to resources
Recommend
Computational complexity, speedable and levelable sets
The Journal of Symbolic Logic, Vol. 42, Iss. 4, 1977-12 ,pp. :
Effectively closed sets and enumerations
Archive for Mathematical Logic, Vol. 46, Iss. 7-8, 2008-05 ,pp. :
On the construction of effectively random sets
The Journal of Symbolic Logic, Vol. 69, Iss. 3, 2004-09 ,pp. :
Effectively nowhere simple sets
The Journal of Symbolic Logic, Vol. 49, Iss. 1, 1984-03 ,pp. :