A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection
Journal of Symbolic Logic 71 (4):1237 - 1283 (2006)
| Abstract | In this paper we introduce a notation system for the infinitary derivations occurring in the ordinal analysis of KP + Π₃-Reflection due to Michael Rathjen. This allows a finitary ordinal analysis of KP + Π₃-Reflection. The method used is an extension of techniques developed by Wilfried Buchholz, namely operator controlled notation systems for RS∞-derivations. Similarly to Buchholz we obtain a characterisation of the provably recursive functions of KP + Π₃-Reflection as <-recursive functions where < is the ordering on Rathjen's ordinal notation system J(K). Further we show a conservation result for $\Pi _{2}^{0}$-sentences | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesToshiyasu Arai (2000). Ordinal Diagrams for Π3-Reflection. Journal of Symbolic Logic 65 (3):1375 - 1394.
Mitsuhiro Okada (1987). A Simple Relationship Between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams. Journal of Symbolic Logic 52 (3):577-581.
Toshiyasu Arai (2002). Review: Wilfried Buchholz, Notation Systems for Infinitary Derivations ; Wilfried Buchholz, Explaining Gentzen's Consistency Proof Within Infinitary Proof Theory ; Sergei Tupailo, Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals. [REVIEW] Bulletin of Symbolic Logic 8 (3):437-439.
Benjamin Blankertz & Andreas Weiermann (1999). A Uniform Approach for Characterizing the Provably Total Number-Theoretic Functions of KPM and (Some of) its Subsystems. Studia Logica 62 (3):399-427.
Toshiyasu Arai (1998). Variations on a Theme by Weiermann. Journal of Symbolic Logic 63 (3):897-925.
Andreas Weiermann (2001). Some Interesting Connections Between the Slow Growing Hierarchy and the Ackermann Function. Journal of Symbolic Logic 66 (2):609-628.
Andreas Weiermann (1998). How is It That Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study. Journal of Symbolic Logic 63 (4):1348-1370.
Jeremy Avigad (2002). An Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations. Journal of Mathematical Logic 2 (01):91-112.
Michael Rathjen (1995). Recent Advances in Ordinal Analysis: Π 21-CA and Related Systems. Bulletin of Symbolic Logic 1 (4):468 - 485.
Jeremy Avigad & Richard Sommer (1997). A Model-Theoretic Approach to Ordinal Analysis. Bulletin of Symbolic Logic 3 (1):17-52.
Volker Halbach (2001). Disquotational Truth and Analyticity. Journal of Symbolic Logic 66 (4):1959-1973.
Reinhard Kahle (2002). Mathematical Proof Theory in the Light of Ordinal Analysis. Synthese 133 (1-2):237 - 255.
Peter Koepke (2005). Turing Computations on Ordinals. Bulletin of Symbolic Logic 11 (3):377-397.
Andreas Weiermann (1996). How to Characterize Provably Total Functions by Local Predicativity. Journal of Symbolic Logic 61 (1):52-69.
Analytics
Monthly downloads |
Added to index2010-08-24Total downloads5 ( #160,428 of 549,124 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
