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 N-reflecting ordinals. One is based on N-10-inductive definitions, and the other is based on distinguished classes.
0