Pulsating hierarchies (Q1920764)

In this paper the author continues his earlier investigations on recursive hierarchies by means of iterated Kleene computability [Algebra Logika 12, 3-21 (1973; Zbl 0291.02029); Mat. Sb., Nov. Ser. 101, 21-43 (1976; Zbl 0342.02031); Sib. Mat. Zh. 30, No. 6, 26-41 (1989; Zbl 0718.03033); Algebra Logika 29, No. 4, 385-397 (1990; Zbl 0810.03038)]. The author investigates enumerated monotone (with respect to inclusion) transfinite sequences of oracles of a special type associated with an ordinal enumeration \(\nu\). Each oracle is regular, weakly founded and computes the type-2 functional \[ E_{1}(\beta)= \begin{cases} 0, &\text{ if }\forall \eta \exists t(\beta (\left\langle \eta(0),\ldots ,\eta (t-1)\right\rangle)=0);\\ 1, &\text{ otherwise.}\end{cases} \] The author constructs the hierarchy of oracles simultaneously with constructing the enumeration \(\nu\) in a way making the computational power of oracles grow as slowly as possible. Generation of the hierarchy as well as the associated numbering is based on generation of auxiliary oracles using temporary indices for ``greater'' ordinals and then replacing them by ``true'' indices. The technique of the process of reorganizing the hierarchy in the course of its generation, the author calls pulsation. The author proves some properties of characteristics related with the ``terminal'' ordinal \(\tau_0\) in the hierarchy generation. Unfortunately, even a summary of the results obtained in this article requires too much space to be presented here in exact terms.