Article PDF
Avoid common mistakes on your manuscript.
Literature Cited
Yu. L. Ershov, The Theory of Numerations [in Russian], Nauka, Moscow (1977).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
S. S. Marchenkov, "On computable numerations of families of general recursive functions," Algebra Logika,11, No. 5, 588–607 (1972).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
A. B. Khutoretskii, "Two existence theorems for computable numerations," Algebra Logika,8, No. 4, 483–492 (1969).
A. I. Mal'tsev, "Positive and negative numerations," Dokl. Akad. Nauk SSSR,160, No. 2, 278–280 (1965).
A. B. Khutoretskii, "On reducibility of computable numerations," Algebra Logika,8, No. 2, 251–264 (1969).
R. M. Friedberg, "Three theorems on recursive enumeration," J. Symb. Logic,23, No. 3, 309–316 (1958).
M. B. Pour-el "Gödel numberings versus Friedberg numberings," Proc. Am. Math. Soc.,15, No. 2, 252–255 (1964).
M. B. Pour-el and W. A. Howard, "A structural criterion for recursive enumeration without repetition," Z. Math. Logik Grundl. Math.,10, No. 2, 105–114 (1964).
Additional information
Translated from Algebra i Logika, Vol. 19, No. 5, pp. 507–551, September–October, 1980.
Rights and permissions
About this article
Cite this article
Goncharov, S.S. Computable single-valued numerations. Algebra and Logic 19, 325–356 (1980). https://doi.org/10.1007/BF01669607
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01669607