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