Ordinal diagrams for recursively Mahlo universes

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

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]

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

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

Through your library

Similar books and articles

Ordinal Diagrams for $\Pi_3$-Reflection.Toshiyasu Arai - 2000 - Journal of Symbolic Logic 65 (3):1375-1394.
Ordinal diagrams for Π3-reflection.Toshiyasu Arai - 2000 - Journal of Symbolic Logic 65 (3):1375 - 1394.
Proof theory for theories of ordinals—I: recursively Mahlo ordinals.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 122 (1-3):1-85.
Proof-theoretic analysis of KPM.Michael Rathjen - 1991 - Archive for Mathematical Logic 30 (5-6):377-403.
Proof theory for theories of ordinals II: Π3-reflection.Toshiyasu Arai - 2004 - Annals of Pure and Applied Logic 129 (1-3):39-92.

Analytics

Added to PP
2013-11-23

Downloads
30 (#520,056)

6 months
7 (#592,600)

Historical graph of downloads
How can I increase my downloads?