Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators
Logic
2013-04-11 v1
Abstract
In this paper, we give two proofs of the wellfoundedness of recursive notation systems for -reflecting ordinals. One is based on -inductive definitions, and the other is based on distinguished classes.
Keywords
Cite
@article{arxiv.1005.2007,
title = {Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators},
author = {Toshiyasu Arai},
journal= {arXiv preprint arXiv:1005.2007},
year = {2013}
}