Literature Cited
H. Rogers, “Computing degrees of unsolvability,” Math. Ann.,138, 125–140 (1959).
C. E. M. Yates, “On the degrees of index sets. I,” Trans. Amer. Math. Soc.121, 309–318 (1966).
C. E. M. Yates, “On the degrees of index sets. II,” Trans. Amer. Math. Soc.,135, 249–267 (1969).
Yu. L. Ershov, “On index sets,” Sibirsk. Matem. Zh.11, No. 2, 326–342 (1970).
Y. Susneki, “Enumeration of recursive sets” J. Symbolic Logic,24, 311 (1959).
R. Freidberg “Three theorems on recursive enumeration,” J. Symbolic Logic,23, 309–316 (1958).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
S. D. Denisov, “On m-degrees of recursively enumerable sets,” Algebra i Logika (Seminar) [in Russian], Inst. Matem., Sibirskoe Otdelenie Akad. Nauk SSSR9, No. 4, 422–427 (1970).
A. Lachlan “Initial segments of one-one degrees,” Pacific J. Math.,29, 351–367 (1969).
Yu. L. Ershov, “Hyperhypersimple m-degrees,” Algebra i Logika (Seminar) [in Russian], Inst. Matem., Sibirskoe Otdelenie Akad. Nauk SSSR,8, No. 5, 523–552 (1969).
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 12, No. 6, pp. 1292–1300, November–December, 1971.
Rights and permissions
About this article
Cite this article
Kallibekov, S. The index sets of m-degrees. Sib Math J 12, 931–937 (1971). https://doi.org/10.1007/BF00966536
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00966536