On complexity properties of recursively enumerable sets1

Publisher: Cambridge University Press

E-ISSN: 1943-5886|38|4|579-593

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.38, Iss.4, 1973-12, pp. : 579-593

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