Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators

In this paper, we give two proofs of the wellfoundedness of recursive notation systems for ${\mathrm{\Pi }}_N$-reflecting ordinals. One is based on ${\mathrm{\Pi }}_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.