COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY

Publisher: Cambridge University Press

E-ISSN: 1943-5886|79|3|859-881

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.79, Iss.3, 2014-08, pp. : 859-881

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