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

preprint2010arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0