Article PDF
Avoid common mistakes on your manuscript.
Literature Cited
Yu. L. Ershov, “Hyper-hypersimplem-powers,” Algebra Logika,8, No. 5, 523–552 (1969).
S. S. Marchenkov, “On computable numberings of families of general recursive functions,” Algebra Logika,11, No. 5, 586–607 (1972).
I. A. Lavrov, “Computable numberings,” Fifth Internat. Congr. Logic Methodology Philosophy of Science, Contributed Papers, Canada (1975).
Yu. L. Ershov, “Numberings of families of general recursive functions,” Sib. Mat. Zh.,8, No. 5, 1015–1025 (1967).
Yu. L. Ershov, Theory of Numberings [in Russian], Vol. I, Novosibirsk (1969).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
Yu. L. Ershov, Theory of Numberings [in Russian], Vol. II, Novosibirsk (1973).
I. A. Lavrov, “Certain properties of the retracts of a Post numbering,” Algebra Logika,13, No. 6, 662–675 (1974).
Additional information
Translated from Algebra i Logika, Vol. 15, No. 4, pp. 470–484, July–August, 1976.
Rights and permissions
About this article
Cite this article
Selivanov, V.L. Two theorems on computable numberings. Algebra and Logic 15, 297–306 (1976). https://doi.org/10.1007/BF01875946
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01875946