Ordinal diagrams for Π3-reflection

Journal of Symbolic Logic 65 (3):1375 - 1394 (2000)

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 $\alpha 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]

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,766

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
43 (#267,544)

6 months
1 (#386,989)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Proof Theory of Reflection.Michael Rathjen - 1994 - Annals of Pure and Applied Logic 68 (2):181-224.
A Well-Ordering Proof for Feferman's theoryT 0.Gerhard Jäger - 1983 - Archive for Mathematical Logic 23 (1):65-77.
Derivatives of Normal Functions and $$\omega $$ Ω -Models.Toshiyasu Arai - 2018 - Archive for Mathematical Logic 57 (5-6):649-664.
Pure Proof Theory Aims, Methods and Results.Wolfram Pohlers - 1996 - Bulletin of Symbolic Logic 2 (2):159-188.

View all 7 references / Add more references

Citations of this work

Proof Theory for Theories of Ordinals II: Π3-Reflection.Toshiyasu Arai - 2004 - Annals of Pure and Applied Logic 129 (1-3):39-92.
Proof Theory of Weak Compactness.Toshiyasu Arai - 2013 - Journal of Mathematical Logic 13 (1):1350003.
Proof Theory for Theories of Ordinals II:< I> Π_< Sub> 3-Reflection.Toshiyasu Arai - 2004 - Annals of Pure and Applied Logic 129 (1):39-92.

View all 7 citations / Add more citations

Similar books and articles