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

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

2010-05-12

arxiv.org/abs/1005.2007v1

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498976