Article PDF
Avoid common mistakes on your manuscript.
Literature cited
S. D. Denisov, “On m-powers of recursively enumerable sets,” Algebra i Logika,9, No. 4, 422–427 (1970).
Yu. L. Ershov, “Enumeration of families of general recursive functions,” Sibirsk. Matem. Zh.,8, No. 5, 1015–1025 (1969).
A. B. Khutoretskii, “On nonprincipal enumerations,” Algebra i Logika,8, No. 6, 726–732 (1969).
Additional information
Translated from Algebra i Logika, Vol. 10, No. 5, pp. 561–569, September–October, 1971.
Rights and permissions
About this article
Cite this article
Khutoretskii, A.B. On the cardinality of the upper semilattice of computable enumerations. Algebr Logic 10, 348–352 (1971). https://doi.org/10.1007/BF02219842
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02219842