Ordinal diagrams for recursively Mahlo universes

Archive for Mathematical Logic 39 (5):353-391 (2000)

Abstract

In this paper we introduce a recursive notation system $O(\mu)$ of ordinals. An element of the notation system is called an ordinal diagram following G. Takeuti [25]. The system is designed for proof theoretic study of theories of recursively Mahlo universes. We show that for each $\alpha<\Omega$ in $O(\mu)$ KPM proves that the initial segment of $O(\mu)$ determined by $\alpha$ is a well ordering. Proof theoretic study for such theories will be reported in [9]

Download options

PhilArchive



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

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
2013-11-23

Downloads
20 (#563,435)

6 months
1 (#386,499)

Historical graph of downloads
How can I increase my downloads?

Similar books and articles

Ordinal Diagrams for Π3-Reflection.Toshiyasu Arai - 2000 - Journal of Symbolic Logic 65 (3):1375 - 1394.
Proof-Theoretic Analysis of KPM.Michael Rathjen - 1991 - Archive for Mathematical Logic 30 (5-6):377-403.
The Recursively Mahlo Property in Second Order Arithmetic.Michael Rathjen - 1996 - Mathematical Logic Quarterly 42 (1):59-66.
Proof Theory for Theories of Ordinals—I: Recursively Mahlo Ordinals.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 122 (1-3):1-85.
On the Plurality of Gods.Eric Steinhart - 2013 - Religious Studies 49 (3):289-312.
Consistency Proof Via Pointwise Induction.Toshiyasu Arai - 1998 - Archive for Mathematical Logic 37 (3):149-165.
Ein Wohlordnungsbeweis Für Das OrdinalzahlensystemT(J).K. Schütte - 1988 - Archive for Mathematical Logic 27 (1):5-20.