Ordinal analyses for monotone and cofinal transfinite inductions (Q2309490)

It is known that, for subsystems of first-order arithmetic, the \(\Pi^0_2\)-ordinal is less than the ordinal defined as the supremum of provable well-orders using usual transfinite induction. The author defines two weaker forms of induction (called monotone and cofinal) and proves that they are properly weaker by showing that the ordinal of those systems defined as the supremum of provable well-orders using those forms of induction is greater. Specifically, the main result of the paper is that for all \(n\) \[|I\Sigma_n|_{\text{mon}}=|I\Sigma_n|_{\text{cf}}=\omega_{n+2}.\]