Abstract
AbstractIn this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system
$OT$
is introduced based on
$\psi $
-functions. Provable
$\Sigma _{1}$
-sentences on
$L_{\omega _{1}^{CK}}$
are bounded through cut-elimination on operator controlled derivations.
Publisher
Cambridge University Press (CUP)
Reference10 articles.
1. [6] Arai, T. , Wellfoundedness proof for first-order reflection, preprint, 2015, arXiv:1506.05280.
2. Proof theory of reflection;Rathjen;Annals of Pure and Applied Logic,1994
3. Ordinal diagrams for recursively Mahlo universes;Arai;Archive for Mathematical Logic,2000
4. An ordinal analysis of stability;Rathjen;Archive for Mathematical Logic,2005
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献