Article PDF
Avoid common mistakes on your manuscript.
Literature cited
C. E. M. Yates, “On the degrees of index sets,” Trans. Amer. Math. Soc.,121, 309–328 (1966).
C. E. M. Yates, “On the degrees of index sets. II,” Trans. Amer. Math. Soc.,135, 249–267 (1969).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Moscow (1965).
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
G. E. Sacks, Degrees of Unsolvability, Annals of Mathematics, Studies, No. 55, Princeton (1963).
Yu. L. Ershov, “A hierarchy of sets. I–III,” Algebra i Logika,7, No. 1, 47–73 (1968);7, No. 4, 15–47 (1968);9, No. 1, 34–51 (1970).
M. Lerman, “Turing degrees and many-one degrees of maximal sets,” J. Symb. Logic,35, 29–40 (1970).
C. Jockusch, “Relationships between reducibilities,” Trans. Amer. Math. Soc.,142, 229–247 (1969).
S. Kallibekov, “Index sets ofm-degrees,” Sibirsk. Matem. Zh. (in press).
Additional information
Translated from Algebra i Logika, Vol. 10, No. 3, pp. 316–326, May–June, 1971.
Rights and permissions
About this article
Cite this article
Kallibekov, S. Index sets of degrees of unsolvability. Algebr Logic 10, 198–204 (1971). https://doi.org/10.1007/BF02219732
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02219732