Journal of Symbolic Logic

A Buchholz derivation system for the ordinal analysis of KP+Π₃-reflection

Markus Michelbrink

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

In this paper we introduce a notation system for the infinitary derivations occurring in the ordinal analysis of KP+Π_3-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 𝒯(K). Further we show a conservation result for Π⁰₂-sentences.

Article information

Source
J. Symbolic Logic Volume 71, Issue 4 (2006), 1237-1283.

Dates
First available in Project Euclid: 20 November 2006

Permanent link to this document
http://projecteuclid.org/euclid.jsl/1164060454

Digital Object Identifier
doi:10.2178/jsl/1164060454

Mathematical Reviews number (MathSciNet)
MR2275858

Subjects
Primary: 03F03, 03F05, 03F07, 03F15, 03F25, 03F35, 03D20

Keywords
finitary proof theory, ordinal analysis, impredicative theories

Citation

Michelbrink, Markus. A Buchholz derivation system for the ordinal analysis of KP +Π₃-reflection. J. Symbolic Logic 71 (2006), no. 4, 1237--1283. doi:10.2178/jsl/1164060454. http://projecteuclid.org/euclid.jsl/1164060454.


Export citation

References

  • Toshiyasu Arai, Proof theory for theories of ordinals I: recursively Mahlo ordinals, Annals of Pure and Applied Logic, vol. 122 (2003), no. 1--3, pp. 1--85.
  • --------, Proof theory for theories of ordinals II: $\Pi$-3-reflection, Annals of Pure and Applied Logic, vol. 129 (2004), no. 1--3, pp. 39--92.
  • Jon Barwise, Admissible set and structures, Springer Verlag, Berlin, Heidelberg, New York, 1975.
  • Wilfried Buchholz, A simplified version of local predicativity, Proof theory (Peter Aczel, Harold Simmons, and Stan Wainer, editors), Cambridge University Press, Leeds, 1990.
  • --------, Notation systems for infinitary derivations, Archive for Mathematical Logic, vol. 30 (1991).
  • --------, Explaining Gentzen's consistency proof within infinitary proof theory, Computational Logic and Proof Theory, 5th Kurt Gödel Colloqium, KGC'97 (G. Gottlob, A. Leitsch, and D.Mundici, editors), Lecture Notes in Computer Science, vol. 1298, Springer Verlag, 1997.
  • --------, Explaining the Gentzen-Takeuti reduction steps: A second-order system, Archive for Mathematical Logic, vol. 40 (2001), no. 4, pp. 255--272.
  • --------, Finitary treatment of operator controlled derivations, Mathematical Logic Quarterly, vol. 47 (2001), no. 3, pp. 363--396.
  • Wilfried Buchholz and Kurt Schütte, Proof theory of impredicative subsystems of analysis, Bibliopolis, Napoli, 1988.
  • Frank Drake, Set theory: An introduction to large cardinals, North-Holland Publishing Company, Amsterdam, London, 1974.
  • Petr Hajek and Pavel Pudlak, Metamathematics of first-order arithmetic, Springer Verlag, Berlin, 1993.
  • David Hilbert and Paul Bernays, Grundlagen der Mathematik, Zweite Auflage, Springer Verlag, Berlin, Heidelberg, New York, 1968.
  • Gerhard Jäger and Wolfram Pohlers, Eine beweistheoretische Untersuchung von $\Delta^1_2-CA+BI$ und verwandter Systeme, Technical report, 1982.
  • Thomas Jech, Set theory, Springer Verlag, Berlin, Heidelberg, New York, 1997.
  • Hartley Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Company, New York, St. Louis, San Francisco, Toronto, London, Sydney, 1967.
  • Azriel Levy, The size of the indescribable cardinals, Proceedings of Symposia in Pure Mathematics, vol. XII, Part 1, 1971.
  • Markus Michelbrink, Zur endlichen Behandlung der Beweistheorie schwacher Fragmente derMengenlehre: KP + $\Pi_3$-Reflexion, Ph.D. thesis, University of Hannover, 2001.
  • Wolfram Pohlers, Proof theory: An introduction, Lecture Notes in Mathematics, vol. 1407, Springer Verlag, Berlin, 1989.
  • Michael Rathjen, An ordinal analysis of parameter free $\Pi^1_2$-comprehension: Part I.
  • --------, Eine Ordinalzahlanalyse der $\Pi_3$-Reflexion, Ph.D. thesis, Westfälische Wilhelms-Universität Münster, Münster, 1992.
  • --------, Admissible proof theory and beyond, Logic, methodology and philosophy of science IX (D. Prawitz, B. Skyrms, and Westerstahl, editors), Elsevier Science B.V., 1994.
  • --------, Proof theory of reflection, Annals of Pure and Applied Logic, vol. 68 (1994), pp. 181--224.
  • --------, Recent advances in ordinal analysis:$\Pi^1_2-CA$ and related systems, Bulletin of Symbolic Logic, vol. 1 (1995).
  • --------, An ordinal analysis of stability, Archive for Mathematical Logic, vol. 44 (2005), no. 1, pp. 1--62.
  • Kurt Schütte, Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie, Mathematische Annalen, vol. 122 (1951).
  • --------, Proof theory, Springer Verlag, Berlin, Heidelberg, New York, 1977.
  • T. Skolem, Begründung der elementaren Arithmetik durch die rekurrierende Denkweise ohne Anwendung scheinbarer Veränderlicher mit unendlichen Ausdehnungsbereich, From Frege to Gödel. A source book in mathematical logic 1879--1931 (J. van Heienoort, editor), Harvard University Press, 1967.
  • Gaisi Takeuti, Proof theory, 2 ed., Elsevier Science Publishers B.V., Amsterdam, New York, Oxford, Tokyo, 1987.
  • A. S. Troelstra, Metamathematical investigation of intuitionistic arithmetic and analysis, Springer Verlag, Berlin, 1973.
  • A. S. Troelstra and H. Schwichtenberg, Basic proof theory, Cambridge University Press, 1996.
  • A. S. Troelstra and D. van Dalen, Constructivism in mathematics. An introduction, vol. I, Elsevier Science Publishers B.V., Amsterdam, New York, Oxford, Tokyo, 1988.
  • Sergei Tupailo, Finitary reductions for local predicativity, 1: recursively regular ordinals, Logic Colloquium 98 (P. Pudlak S. Buss, P. Hajek, editor), 2000, pp. 465--499.