Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-27T21:24:49.731Z Has data issue: false hasContentIssue false
  • English
  • Français

Ordinal diagrams for Π3-reflection

Published online by Cambridge University Press:  12 March 2014

Toshiyasu Arai
Toshiyasu Arai*
Affiliation:
Faculty of Integrated Arts and Sciences, Hiroshima University, Higashi-Hiroshima, 739-8521, Japan E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we introduce a recursive notation system O(Π3) of ordinals. An element of the notation system is called an ordinal diagram. The system is designed for proof theoretic study of theories of Π3-reflection. We show that for each α < Ω in O(Π3) a set theory KP Π3 for Π3-reflection proves that the initial segment of O(Π3) determined by α is a well ordering. Proof theoretic study for such theories will be reported in [ 4].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 65 , Issue 3 , September 2000 , pp. 1375 - 1394
Copyright
Copyright © Association for Symbolic Logic 2000

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

[1]Arai, T., Proof theory for reflecting ordinals III: Π3-reflecting ordinals, handwritten note, December 1990.Google Scholar
[2]Arai, T., A system (O(π3), <) of ordinal diagrams, handwritten note, October 1990.Google Scholar
[3]Arai, T., Ordinal diagrams for recursively Mahlo universes, Archive for Mathematical Logic, (to appear).Google Scholar
[4]Arai, T., Proof theory for reflecting ordinals II: Π3-reflection, Annals of Pure and Applied Logic, (to appear).Google Scholar
[5]Buchholz, W., Normalfunktionen und konstruktive Systeme von Ordinalzahlen, Proof theory symposium, Kiel 1974, Lecture Notes in Mathematics, vol. 500, Springer-Verlag, 1975, pp. 4–25.Google Scholar
[6]Jäger, G., A well-ordering proof for Feferman's theory T, Archiv für Mathematische Logik und Grundlagenforschung, vol. 23 (1983), pp. 65–77.CrossRefGoogle Scholar
[7]Pohlers, W., Pure proof theory, aims, methods and results, The Bulletin of Symbolic Logic, vol. 2 (1996), pp. 159–188.CrossRefGoogle Scholar
[8]Rathjen, M., Proof theory of reflection, Annals of Pure and Applied Logic, vol. 68 (1994), pp. 181–224.CrossRefGoogle Scholar
[9]Richter, W.H. and Aczel, P., Inductive definitions and reflecting properties of admissible ordinals, Generalized recursion theory, Studies in Logic, vol. 79, North-Holland, 1974, pp. 301–381.Google Scholar
[10]Schlüter, A., What is provable using first order reflection, Annals of Pure and Applied Logic, (to appear).Google Scholar
[11]Schütte, K., Ein Wohlordnungsbeweis für das Ordinalzahlensystem T(J), Archive for Mathematical Logic, vol. 27 (1988), pp. 5–20.CrossRefGoogle Scholar