×

Enumerable sets are diophantine. (English. Russian original) Zbl 0212.33401

Sov. Math., Dokl. 11, 354-358 (1970); translation from Dokl. Akad. Nauk SSSR 191, 279-282 (1970).

MSC:

03D25 Recursively (computably) enumerable sets and degrees
03D20 Recursive functions and relations, subrecursive hierarchies
03D35 Undecidability and degrees of sets of sentences
PDFBibTeX XMLCite