Publisher： Cambridge University Press
E-ISSN： 1943-5886|63|1|1-28
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.63, Iss.1, 1998-03, pp. : 1-28
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
The Complexity of Orbits of Computably Enumerable Sets
Bulletin of Symbolic Logic, Vol. 14, Iss. 1, 2008-03 ,pp. :
Access to resources
Recommend
On orbits, of prompt and low computably enumerable sets
The Journal of Symbolic Logic, Vol. 67, Iss. 2, 2002-06 ,pp. :
Isomorphisms of splits of computably enumerable sets
The Journal of Symbolic Logic, Vol. 68, Iss. 3, 2003-09 ,pp. :
Definable Encodings in the Computably Enumerable Sets
Bulletin of Symbolic Logic, Vol. 6, Iss. 2, 2000-06 ,pp. :