Access the full text.
Sign up today, get DeepDyve free for 14 days.
[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
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.