Provability algebras and proof-theoretic ordinals, I

We suggest an algebraic approach to proof-theoretic analysis based on the notion of graded provability algebra, that is, Lindenbaum boolean algebra of a theory enriched by additional operators which allow for the structure to capture proof-theoretic (syntax-sensitive) information. We use this method to analyze Peano arithmetic and show how an ordinal notation system up to €0 can be recovered from the corresponding algebra canonical way. This method also establishes links between prooftheoretic ordinal analysis and the work which has been done in the last two decades on provability, logic and reflection principles. Because of its abstract algebraic nature, we hope it will also be of interest for nonprooftheorists.

[1]  Lars Kristiansen Subrecursive degrees and fragments of Peano Arithmetic , 2001, Arch. Math. Log..

[2]  Lev D. Beklemishev,et al.  On the induction schema for decidable predicates , 2000, Journal of Symbolic Logic.

[3]  Lev D. Beklemishev,et al.  Induction Rules, Reflection Principles, and Provably Recursive Functions , 1995, Ann. Pure Appl. Log..

[4]  G. Boolos,et al.  Self-Reference and Modal Logic , 1985 .

[5]  S. Buss Handbook of proof theory , 1998 .

[6]  Lev D. Beklemishev,et al.  Proof-theoretic analysis by iterated reflection , 2003, Arch. Math. Log..

[7]  Krister Segerberg,et al.  An essay in classical modal logic , 1971 .

[8]  V. Yu. Shavrukov,et al.  Undecidability in diagonalizable algebras , 1997, Journal of Symbolic Logic.

[9]  W. Pohlers Chapter IV – Subsystems of Set Theory and Second Order Number Theory , 1998 .

[10]  Shavrukov,et al.  Subalgebras of Diagonalizable Algebras of Theories Containing Arithmetic , 1993 .

[11]  Konstantin N. Ignatiev,et al.  On strong provability predicates and the associated modal logics , 1993, Journal of Symbolic Logic.

[12]  Ulf R. Schmerl A Fine Structure Generated by Reflection Formulas over Primitive Recursive Arithmetic , 1979 .

[13]  R. Solovay Provability interpretations of modal logic , 1976 .

[14]  Lev D. Beklemishev,et al.  A proof-theoretic analysis of collection , 1998, Arch. Math. Log..

[15]  G. Boolos The logic of provability , 1993 .

[16]  Saul A. Kripke,et al.  Deduction-preserving "Recursive Isomorphisms" between theories , 1967 .

[17]  D.H.J. de Jongh,et al.  The logic of the provability , 1998 .