Literature Cited
Yu. L. Ershov, Theory of Enumerations, Part I [in Russian], Izd-vo NGU, Novosibirsk (1969).
S. D. Denisov, “On m-degrees of recursively enumerable sets,” Algebra i Logika,9, No. 4, 422–427 (1970).
A. B. Khutoretskii, “On nonprincipal enumerations,” Algebra i Logika,8, No. 6, 726–732 (1969).
S. S. Marchenkov, “On computable enumerations of general recursive functions,” Algebra i Logika,11, No. 5, 588–607 (1972).
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 15, No. 4, pp. 730–738, July–August, 1974.
Rights and permissions
About this article
Cite this article
Badaev, S.A. On incomparable enumerations. Sib Math J 15, 519–524 (1974). https://doi.org/10.1007/BF00967428
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00967428