Author： Ambos-Spies Klaus
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.52, Iss.1, 2013-01, pp. : 2-27
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
Decomposition and infima in the computably enumerable degrees
The Journal of Symbolic Logic, Vol. 68, Iss. 2, 2003-06 ,pp. :
Access to resources
Recommend
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. :
The Complexity of Orbits of Computably Enumerable Sets
Bulletin of Symbolic Logic, Vol. 14, Iss. 1, 2008-03 ,pp. :
Bounding minimal degrees by computably enumerable degrees
The Journal of Symbolic Logic, Vol. 63, Iss. 4, 1998-12 ,pp. :