Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-26T07:23:14.367Z Has data issue: false hasContentIssue false
  • English
  • Français

A SIMPLIFIED ORDINAL ANALYSIS OF FIRST-ORDER REFLECTION

Part of: Proof theory and constructive mathematics

Published online by Cambridge University Press:  23 October 2020

TOSHIYASU ARAI
TOSHIYASU ARAI*
Affiliation:
GRADUATE SCHOOL OF SCIENCE, CHIBA UNIVERSITY 1-33, YAYOI-CHO, INAGE-KU, CHIBA, 263-8522, JAPAN Current address: GRADUATE SCHOOL OF MATHEMATICAL SCIENCES, UNIVERSITY OF TOKYO 3-8-1 KOMABA, MEGURO-KU, TOKYO153-8914, JAPANE-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In 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.

Keywords

ordinalsMahlo classes

MSC classification

Primary: 03F99: None of the above, but in this section
Type
Articles
Information
The Journal of Symbolic Logic , Volume 85 , Issue 3 , September 2020 , pp. 1163 - 1185
Check for updates
Copyright
© The Association for Symbolic Logic 2020

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Arai, T., Ordinal diagrams for recursively Mahlo universes . Archive for Mathematical Logic , vol. 39 (2000), pp. 353–391.CrossRefGoogle Scholar
Arai, T., Iterating the recursively Mahlo operations , Proceedings of the thirteenth International Congress of Logic Methodology, Philosophy of Science (Glymour, C., Wei, W., and Westerstahl, D., editors), College Publications, King’s College, London, UK, 2009, pp. 21–35.Google Scholar
Arai, T., Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators . Annals of Pure and Applied Logic , vol. 162 (2010), pp. 107–143.CrossRefGoogle Scholar
Arai, T., Conservations of first-order reflections , this Journal, vol. 79 (2014), pp. 814–825.Google Scholar
Arai, T., Proof theory for theories of ordinals III: ΠN-reflection , Gentzen’s Centenary: The Quest of Consistency (Kahle, R. and Rathjen, M., editors), Springer, New York, 2015, pp. 357–424.CrossRefGoogle Scholar
Arai, T., Wellfoundedness proof for first-order reflection, preprint, 2015, arXiv:1506.05280.Google Scholar
Buchholz, W., A simplified version of local predicativity , Proof Theory (Aczel, P. H. G., Simmons, H. and Wainer, S. S., editors), Cambridge University Press, Cambridge, 1992, pp. 115–147.Google Scholar
Pohlers, W. and Stegert, J.-C., Provable recursive functions of reflection , Logic, Construction, Computation (Berger, U., Diener, H., Schuster, P. and Seisenberger, M., editors), Ontos Mathematical Logic, vol. 3, De Gruyter, Berlin, 2012, pp. 381–474.Google Scholar
Rathjen, M., Proof theory of reflection . Annals of Pure and Applied Logic , vol. 68 (1994), pp. 181–224.CrossRefGoogle Scholar
Rathjen, M., An ordinal analysis of stability . Archive for Mathematical Logic , vol. 44 (2005), pp. 1–62.CrossRefGoogle Scholar