Literature Cited
Z. G. Khisamiev and N. G. Khisamiev, “The nonconstructivizability of the reduced part of a strongly constructive torsion-free Abelian group,” Algebra Logika,24, No. 1, 108–118 (1985).
A. I. Mal'tsev, “Positive and negative enumerations,” Dokl. Akad. Nauk SSSR,160, No. 2, 278–280 (1965).
Yu. L. Ershov, “On calculable enumerations,” Algebra Logika,7, No. 5, 71–99 (1968).
C. E. M. Yates, “On the degrees of index sets. II,” Trans. Am. Math. Soc.,135, 249–266 (1969).
S. Kalibekov, “On index sets of m-degrees,” Sib. Mat. Zh.,12, No. 6, 1292–1300 (1971).
Yu. L. Ershov, The Theory of Enumerations [in Russian], Nauka, Moscow (1977).
C. E. M. Yates, “On the degrees of index sets,” Trans. Am. Math. Soc.,121, 309–328 (1966).
H. Rogers, “Computing degrees of unsolvability,” Math. Ann.,139, 125–140 (1959).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
S. K. Klini, Introduction to Mathematics [Russian translation], IL, Moscow (1957).
Additional information
Alma-Ata. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 27, No. 5, pp. 182–187, September–October, 1986.
Rights and permissions
About this article
Cite this article
Khisamiev, Z.G. Calculable enumerations and equivalence relations. Sib Math J 27, 779–783 (1986). https://doi.org/10.1007/BF00969208
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00969208