Well ordering principles for iterated \(\Pi^1_1\)-comprehension (Q6080077)

The authors present new reverse mathematical equivalences between ordinal collapsing principles, iterated \(\Pi^1_1\)-comprehension, and the existence of admissible sets. A central result is that, over \(\mathsf{RCA}_0\), the following are equivalent for any infinite well-ordering \(\nu\): (1) \(\Pi^1_1\)-recursion along \(\nu\); (2) any dilator has a well founded \(\nu\)-fixed point; and (3) if \(D\) is a dilator, then \(\psi_\nu (D)\) is well founded. Using \(\mathsf{ATR}_0^{\mathsf{set}}\) as a base system, (1) and (3) are shown to be equivalent to: (4) for any set \(u\), there is a sequence of admissible sets \(\mathsf{Ad}_\alpha \owns u\) for \(\alpha < \nu\) such that \(\alpha < \beta < \nu\) entails \(\mathsf{Ad}_\alpha \in\mathsf{Ad}_\beta\) (where \(\nu\) is viewed as an ordinal). The result has consequences in the characterization of \(\beta\)-models of \(\Pi^1_1\)-comprehension, including a result promised in a paper of \textit{M. Rathjen} [in: Axiomatic thinking II. Cham: Springer. 89--127 (2022; Zbl 07632450)]. \textit{A. Freund} has applied the work presented here to prove the equivalence of \(\Pi^1_1\)-transfinite recursion and a uniform Kruskal-Friedman theorem with gap condition [``Reverse mathematics of a uniform Kruskal-Friedman theorem'', Preprint, \url{arXiv:2112.08727}]. These new iterated results build on earlier results on the equivalence of \(\Pi^1_1\)-comprehension and fixed points of dilators in the work of \textit{A. Freund} [J. Math. Log. 20, No. 2, Article ID 2050006, 26 p. (2020; Zbl 1457.03027)].