An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension (Q1777268): Difference between revisions

This is the second paper, in series of three, towards an ordinal analysis of \(\Pi_2^1\)-comprehension. The author gives an ordinal analysis of \(\mathbf{ {KPi}}\) plus the assertion that there exists a stable ordinal (a theory corresponding to \(\Delta_2^1\)-comprehension, bar induction and \(\Pi_2^1\)-comprehension for formulae without set parameters). Compared with the first paper of the series [\textit{M. Rathjen}, ``An ordinal analysis of stability'', Arch. Math. Logic 44, No. 1, 1--62 (2005; Zbl 1068.03046), reviewed above], the additional technical difficulty is that the ordinal representation system requires ``collapsing'' functions -- now called, more adequately, projection functions -- which ``project down intervals \([\phi,\beta]\) of ordinals below \(\pi\). What distinguishes it from the last paper [\textit{M. Rathjen}, An ordinal analysis of iterated \(\Pi_2^1\) comprehension and related systems. Preprint, 85 pages] in the series is that such intervals are not too complicated in that they do not contain stable ordinals \({}> \pi\)'' [p.~264].