This is a preview of subscription content, log in via an institution to check access.
Literature cited
G. Addison, “Theory of hierarchies,” Symp. Mathematical Logic and Its Applications, Mir, Moscow (1965), pp. 23–36.
A. I. Mal'tsev, Algorithms and Recursive Functions, Nauka (1965).
L. Hay, “Isomorphism types of index sets of partial recursive functions,” Proc. Amer. Math. Soc.,17, 106–110 (1966).
L. Hay, “One-one degree of index sets of finite classes of finite sets,” Notices Amer. Math. Soc.,14, 844 (1967).
W. Markwald, “Ein Satz uber die elementararithmetischen Definiterbarkeitsklassen,” Archiv fur Math. Logik und Grundl. 2/2–4, 78–86 (1956).
H. Putnam, “Trial and error predicates and the solution to a problem of Mostowski,” Journ. Symb. Log.,30, 49–57 (1965).
N. Shapiro, “Degrees of computability,” Trans. Amer. Math. Soc.,82, 281–299 (1956).
Additional information
Translated from Algebra i Logika, Vol. 7, No. 1, pp. 47–74, January–February, 1968.
Rights and permissions
About this article
Cite this article
Ershov, Y.L. A hierarchy of sets. I. Algebr Logic 7, 25–43 (1968). https://doi.org/10.1007/BF02218750
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02218750