Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Where is the Gödel-point hiding: Gentzen’s Consistency Proof of 1936 and His Representation of Constructive OrdinalsIntroduction

Where is the Gödel-point hiding: Gentzen’s Consistency Proof of 1936 and His Representation of... [This chapter deals with brief history of Gentzen’s consistency proofs and his work on proof systems which were actually byproducts of his ambition to prove the consistency of arithmetic. There is a plan in his handwritten thesis manuscript according to which he aimed to prove the consistency with the help of normalization for natural deduction. As this did not work, he developed a special semantic explanation of correctness in arithmetic. The proof based on this explanation was criticized, so Gentzen returned to an earlier idea of transfinite induction. The last proof shows directly that although the transfinite induction up to ε0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon _0$$\end{document} can be formalized in arithmetic, it cannot be proved there. Further, this chapter deals with non-technical parts of his 1936 article.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Where is the Gödel-point hiding: Gentzen’s Consistency Proof of 1936 and His Representation of Constructive OrdinalsIntroduction

Loading next page...
 
/lp/springer-journals/where-is-the-g-del-point-hiding-gentzen-s-consistency-proof-of-1936-uEEKgDyJ7r
Publisher
Springer International Publishing
Copyright
© The Author(s) 2014
ISBN
978-3-319-02170-6
Pages
1 –9
DOI
10.1007/978-3-319-02171-3_1
Publisher site
See Chapter on Publisher Site

Abstract

[This chapter deals with brief history of Gentzen’s consistency proofs and his work on proof systems which were actually byproducts of his ambition to prove the consistency of arithmetic. There is a plan in his handwritten thesis manuscript according to which he aimed to prove the consistency with the help of normalization for natural deduction. As this did not work, he developed a special semantic explanation of correctness in arithmetic. The proof based on this explanation was criticized, so Gentzen returned to an earlier idea of transfinite induction. The last proof shows directly that although the transfinite induction up to ε0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon _0$$\end{document} can be formalized in arithmetic, it cannot be proved there. Further, this chapter deals with non-technical parts of his 1936 article.]

Published: Oct 23, 2013

Keywords: Gentzen; Gentzen’s thesis; Proof systems; Consistency proofs; Consistency proofs of arithmetic; History of proof systems; History of consistency proofs; Consistency of arithmetic; Hilbert’s program

There are no references for this article.