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 $Π_N$-reflecting ordinals. One is based on $Π_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
