This is a preview of subscription content, log in via an institution to check access.
Literature Cited
Yu. L. Ershov, Enumeration Theory [in Russian], Vol. 1, Novosibirsk State Univ. (1969).
Yu. L. Ershov, "Enumeration of families of general recursive functions," Sib. Mat. Zh.,8, No. 5, 1015–1025 (1967).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965).
Yu. L. Ershov and I. A. Lavrov. "On computable enumerations, II," Algebra Logika,8, No. 1, 65–71 (1969).
V. V. V'yugin, "On some examples of semilattices of computable enumerations," Algebra Logika,12, No. 5, 512–529 (1973).
S. S. Marchenkov, "On computable enumerations of families of general recursive functions," Algebra Logika,11, No. 5, 588–607 (1972).
F. I. Validov, "On minimal enumerations of families of general recursive functions," in: Proceedings of the Third All-Union Conference on Mathematical Logic [in Russian], Novosibirsk (1974), Theses of the papers, 26.
Additional information
Translated from Algebra i Logika, Vol. 16, No. 2, pp. 129–148, March–April, 1977.
Rights and permissions
About this article
Cite this article
Badaev, S.A. Computable enumerations of families of general recursive functions. Algebra and Logic 16, 83–98 (1977). https://doi.org/10.1007/BF01668593
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01668593