Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators
classification
🧮 math.LO
keywords
definitionsinductiveproofswellfoundednessclassesdistinguishedfirstgive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.