Ershov, Yu. L. On a hierarchy of sets. III. (English. Russian original) Zbl 0233.02017 Algebra Logic 9(1970), 20-31 (1971); translation from Algebra Logika 9, 34-51 (1970). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 9 ReviewsCited in 33 Documents MSC: 03D55 Hierarchies of computability and definability Citations:Zbl 0216.009 PDFBibTeX XMLCite \textit{Yu. L. Ershov}, Algebra Logic 9, 20--31 (1971; Zbl 0233.02017); translation from Algebra Logika 9, 34--51 (1970) Full Text: DOI References: [1] Yu. L. Ershov, ”On a hierarchy of sets. I,” Alg. i Log.,7, No. 1, 47–74 (1968). · Zbl 0216.00901 [2] Yu. L. Ershov, ”On a hierarchy of sets. II,” Alg. i Log.,7, No. 4, 15–47 (1968). · Zbl 0216.00902 [3] Yu. L. Ershov, ”Completely numbered sets,” Sibir. Matem. Zh.,10, No. 5, 1048–1067 (1969). [4] A. I. Mal’tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965). [5] H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967). · Zbl 0183.01401 [6] J. C. E. Dekker and J. Myhill, ”Recursive equivalence types,” Univ. of Calif. Publ.,3, 67–213 (1960). · Zbl 0249.02021 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.