Abstract
It is the goal of ordinal theoretic proof theory to reduce the consistency of theories for formalising mathematical proofs to the well-foundedness of ordinal notation systems. In order to obtain a satisfactory solution to the consistency problem, this reduction needs to be supplemented by a second step, namely by proofs of the well-foundedness of the ordinal notation systems in ‘safe’ theories, for which one has an argument that everything shown in these theories is valid. Because of Gödel’s incompleteness theorem, a mathematical correctness proof can prove only relative correctness, but never provide an absolute proof of correctness. In order to obtain an argument which provides absolute trust, the only possibility is to have a philosophical correctness argument. Although there are other theories that could serve as such safe theories, the theories for which such arguments have best been worked out at present are extensions of Martin-Löf type theory (MLTT).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Birkhäuser Verlag AG
About this chapter
Cite this chapter
Setzer, A. (2008). Proof theory and Martin-Löf Type Theory. In: van Atten, M., Boldini, P., Bourdeau, M., Heinzmann, G. (eds) One Hundred Years of Intuitionism (1907–2007). Publications des Archives Henri Poincaré / Publications of the Henri Poincaré Archives. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-8653-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-7643-8653-5_16
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-8652-8
Online ISBN: 978-3-7643-8653-5
eBook Packages: Humanities, Social Sciences and LawHistory (R0)