Wellfoundedness proof with the maximal distinguished set
Logic
2022-11-17 v1
Abstract
In arXiv:2208.12944 it is shown that an ordinal is an upper bound for the proof-theoretic ordinal of a set theory . In this paper we show that a second order arithmetic proves the wellfoundedness up to for each . It is easy to interpret in .
Keywords
Cite
@article{arxiv.2211.08619,
title = {Wellfoundedness proof with the maximal distinguished set},
author = {Toshiyasu Arai},
journal= {arXiv preprint arXiv:2211.08619},
year = {2022}
}
Comments
arXiv admin note: text overlap with arXiv:1506.05280, arXiv:2112.09871, arXiv:2208.12944