Previous: Gödel

Up: Supplementary Text Topics

The Consistency of Arithmetic: Gentzen


Gentzen introduced the use of finite sequences of formulas as a basic object, called a sequent; for the propositional case this has been described in the previous commentary General discussion of proof systems. He considered this formalization closer to the way we actually reason.

Then he turned to the question of the consistency of PA. One consequence of Gödel's work is the fact that if one can prove the consistency of PA, then the proof ``is not expressible in PA''. This is understood to imply that one cannot prove the consistency of PA by finitistic means, as had been hoped by Hilbert. gif Gentzen did succeed in proving the consistency of PA, but by using a non finitistic framework, namely he used transfinite induction up to the ordinal , the limit of .



References

1
G. Gentzen, Untersuchung über das logische Schliessen. Math. Z. 39 (1934), 176-210, 405-431.

2
G. Gentzen, Die Widerspruchsfreiheit der reinen Zahlentheorie. Math. Ann. 112 (1936), 493-565.


Previous: Gödel

Up: Supplementary Text Topics

Fri Jan 31 14:12:07 EST 1997
© Stanley Burris