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

Abstract

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

Cited by in corpus (1)

• Iterating the recursively Mahlo operations