On a hierarchy of sets, II

Yu. L. Ershov, “A hierarchy of sets, 1,” Algebra i Logika,7, No. 1, 47–74 (1968).

A. I. Mal'tsev, “Algorithms and recursive functions,” Nauka (1965).

J. W. Addison, “The method of alternating chains,” in: The Theory of Models, North Holland, Amsterdam (1965), pp. 1–16.

S. Feferman, “Classification of recursive functions by means of hierarchies,” Trans. Math. Soc.104, No. 1, 101–122 (1962).

S. Feferman and C. Spector, “Incompleteness along paths in progressions of theories,” J. Symb. Logic,27, No. 4, 383–390 (1962).

S. C. Kleene, “On the forms of predicates in the theory of constructive ordinals” (second paper), Amer. J. Math.,77, 405–428 (1955).

H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw Hill (1967).

H. Putnam, “Trial and error predicates and the solution to a problem of Mostowski,” J. Symb. Logic,30, 49–57 (1965).

I. Grossly and K. Schütte, “Non-uniqueness at w2 in Kleene's,” Archiv. für Math. Log. Grundl. 9/3–4, 95–101 (1966).

C. Spector, “Recursive well-orderings,” J. Symb. Logic,20, 151–163 (1955).