A simplified ordinal analysis of first-order reflection
Logic
2021-07-01 v1
Abstract
In this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system is introduced based on -functions. Provable -sentences on are bounded through cut-elimination on operator controlled derivations.
Cite
@article{arxiv.1907.07611,
title = {A simplified ordinal analysis of first-order reflection},
author = {Toshiyasu Arai},
journal= {arXiv preprint arXiv:1907.07611},
year = {2021}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1506.05280