On reduction of the decision problem of recursively enumerable sets to the separability problem

DOI10.1090/TRANS2/083/02zbMath0188.32801OpenAlexW4241049708MaRDI QIDQ5582335

A. A. Muchnik

Publication date: 1969

Published in: American Mathematical Society Translations: Series 2 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/trans2/083/02

zbMATH Keywords

constructive mathematicsrecursion theory

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Recursively (computably) enumerable sets and degrees (03D25)

This page was built for publication: On reduction of the decision problem of recursively enumerable sets to the separability problem