This is a preview of subscription content, log in via an institution to check access.
Literature Cited
Yu. L. Ershov, “On a hierarchy of sets,” I, Algebra i Logika,7, No. 1, 47–74 (1968); II, Algebra i Logika,7, No. 4, 15–47 (1968).
Yu. L. Ershov, “Hypersimple m-degrees,” Algebra i Logika,8, No. 5 (1969).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1966).
L. Hey, “Isomorphism types of index sets of partial recursive functions,” Proc. Amer. Math. Soc.,17, 106–110 (1966).
L. Hey, “Index sets of finite classes of recursively enumerable sets,” J. Symb. Logic,34, No. 1, 39–44 (1969).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw Hill (1967).
H. Rogers, Jr., “Gödel numberings of partial recursive functions,” J. Sympb. Logic,23, No. 3, 331–341 (1959).
H. Rogers, Jr., “Computing degrees of unsolvability,” Math. Ann.,138, 125–140 (1959).
N. Shapiro, “Degrees of computability,” Trans. Amer. Math. Soc.,82, 281–299 (1956).
C. E. M. Gates, “On the degrees of index sets,” Trans. Amer. Math. Soc.,121, No. 2, 309–328 (1966).
C. E. M. Gates, “On the degrees of index sets. II,” Trans. Amer. Math. Soc.,135, 249–266 (1969).
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 11, No. 2, pp. 326–342, March–April, 1970.
Rights and permissions
About this article
Cite this article
Ershov, Y.L. On index sets. Sib Math J 11, 246–258 (1970). https://doi.org/10.1007/BF00967299
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00967299