Matiyasevich, Yu. V. 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). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 24 ReviewsCited in 127 Documents MSC: 03D25 Recursively (computably) enumerable sets and degrees 03D20 Recursive functions and relations, subrecursive hierarchies 03D35 Undecidability and degrees of sets of sentences Citations:Zbl 0223.02041; Zbl 0219.02035; Zbl 0223.02042 PDFBibTeX XMLCite \textit{Yu. V. Matiyasevich}, Sov. Math., Dokl. 11, 354--358 (1970; Zbl 0212.33401); translation from Dokl. Akad. Nauk SSSR 191, 279--282 (1970)