Mathematical Proof Theory in the Light of Ordinal Analysis

@article{Kahle2004MathematicalPT,
  title={Mathematical Proof Theory in the Light of Ordinal Analysis},
  author={R. Kahle},
  journal={Synthese},
  year={2004},
  volume={133},
  pages={237-255}
}
  • R. Kahle
  • Published 2004
  • Mathematics, Computer Science
  • Synthese
  • We give an overview of recent results in ordinal analysis. Therefore,we discuss the different frameworks used in mathematical proof-theory, namely subsystem of analysis including reversemathematics, Kripke–Platek set theory, explicitmathematics, theories of inductive definitions,constructive set theory, and Martin-Löf’s typetheory. 
    3 Citations

    Topics from this paper.

    Proof theory and Martin-Löf Type Theory
    • 2
    • PDF
    Predicativity beyond Gamma_0
    • 4
    • PDF

    References

    SHOWING 1-10 OF 67 REFERENCES
    Proof theory and ordinal analysis
    • W. Pohlers
    • Mathematics, Computer Science
    • Arch. Math. Log.
    • 1991
    • 35
    The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories
    • 48
    • PDF
    Proof-theoretic analysis of KPM
    • M. Rathjen
    • Mathematics, Computer Science
    • Arch. Math. Log.
    • 1991
    • 85
    • PDF
    The Type Theoretic Interpretation of Constructive Set Theory
    • 295
    Well-Ordering, Proofs for Martin-Löf Type Theory
    • A. Setzer
    • Mathematics, Computer Science
    • Ann. Pure Appl. Log.
    • 1998
    • 38
    • PDF
    Proof Theory of Reflection
    • M. Rathjen
    • Mathematics, Computer Science
    • Ann. Pure Appl. Log.
    • 1994
    • 63
    • PDF
    Extending the system T0 of explicit mathematics: the limit and Mahlo axioms
    • 26
    • PDF
    How to Develop Proof-Theoretic Ordinal Functions on the Basis of Admissible Ordinals
    • M. Rathjen
    • Mathematics, Computer Science
    • Math. Log. Q.
    • 1993
    • 32
    A Mathematical Incompleteness in Peano Arithmetic
    • 387