Ordinal notations based on a weakly Mahlo cardinal (Q920986)

It is well-known that the subsystem of second order arithmetic with \(\Delta^ 1_ 2\)-comprehension and Bar-induction has been up to now the strongest for which there is a computation of its proof-theoretic ordinal. This result is due to Jäger and Pohlers (1982), who used an extension KPi of Kripke-Platek set theory. The standard model of KPi is the initial segment of the constructible hierarchy of L formed by the first recursively inaccessible ordinal. The next step towards an ordinal analysis of second order arithmetic with \(\Pi^ 1_ 2\)-comprehension is given by a set theory axiomatizing essential features of \(L[\mu_ 0]\), for the first recursively Mahlo ordinal \(\mu_ 0\). The author calls such a theory KPM. The previous results of Harrington and W. H. Richter indicate that a proof theory of KPM would be a starting point for a proof theory of the superjumps and non-monotonic inductive definitions. The paper under review presents a perspicuous ordinal notation system which is sufficient for the proof-theoretic treatment of KPM. It turns out that the assumption that there exists a Mahlo cardinal helps in simplifying proofs, but is not necessary in full strength.