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 OrdinalsConsistency Proof

Where is the Gödel-point hiding: Gentzen’s Consistency Proof of 1936 and His Representation of... [Gentzen’s consistency proof of 1936 is explained in full detail. The chapter begins with the method of assigning ordinal numbers in Gentzen’s representation to derivations. The second part introduces reduction steps for derivations whose endsequent is not in endform and shows, at the same time, that every reduction lowers the ordinal number of the given derivation. The proof consists in analysing cases according to the last inference rule that is used in the derivation to reduce. We obtain the consistency of arithmetic in this way as the derivation of →0=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \rightarrow 0=1$$\end{document} would be reduced infinitely many times. Hence, we would construct an infinite decreasing sequence of ordinal numbers which is not possible.] 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 OrdinalsConsistency Proof

Download PDF
29 pages

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

Abstract

[Gentzen’s consistency proof of 1936 is explained in full detail. The chapter begins with the method of assigning ordinal numbers in Gentzen’s representation to derivations. The second part introduces reduction steps for derivations whose endsequent is not in endform and shows, at the same time, that every reduction lowers the ordinal number of the given derivation. The proof consists in analysing cases according to the last inference rule that is used in the derivation to reduce. We obtain the consistency of arithmetic in this way as the derivation of →0=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \rightarrow 0=1$$\end{document} would be reduced infinitely many times. Hence, we would construct an infinite decreasing sequence of ordinal numbers which is not possible.]

Published: Oct 23, 2013

Keywords: Consistency of arithmetic; Consistency proof of 1936; Gentzen’s consistency proofs; Reduction steps; Reduction steps for derivations

There are no references for this article.