The Complexity of Orbits of Computably Enumerable Sets

Publisher: Cambridge University Press

E-ISSN: 1943-5894|14|1|69-87

ISSN: 1079-8986

Source: Bulletin of Symbolic Logic, Vol.14, Iss.1, 2008-03, pp. : 69-87

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract