Gödel's reformulation of Gentzen's first consistency proof for arithmetic: The no-counterexample interpretation
Graduate studies at Western
Bulletin of Symbolic Logic 11 (2):225-238 (2005)
|Abstract||The last section of “Lecture at Zilsel’s” [9, §4] contains an interesting but quite condensed discussion of Gentzen’s ﬁrst version of his consistency proof for P A , reformulating it as what has come to be called the no-counterexample interpretation. I will describe Gentzen’s result (in game-theoretic terms), ﬁll in the details (with some corrections) of Godel's reformulation, and discuss the relation between the two proofs.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Thomas Hofweber (2000). Proof-Theoretic Reduction as a Philosopher's Tool. Erkenntnis 53 (1-2):127-146.
Andrés R. Raggio (1964). Direct Consistency Proof of Gentzen's System of Natural Deduction. Notre Dame Journal of Formal Logic 5 (1):27-30.
Jan von Plato & G. Gentzen (2008). Gentzen's Proof of Normalization for Natural Deduction. The Bulletin of Symbolic Logic 14 (2):240 - 257.
Francesco Berto (2009). There's Something About Gödel: The Complete Guide to the Incompleteness Theorem. Wiley-Blackwell.
Ulrich Kohlenbach (1999). On the No-Counterexample Interpretation. Journal of Symbolic Logic 64 (4):1491-1511.
Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.) (2010). Kurt Gödel: Essays for His Centennial. Association for Symbolic Logic.
Added to index2009-01-28
Total downloads19 ( #71,257 of 738,054 )
Recent downloads (6 months)1 ( #61,269 of 738,054 )
How can I increase my downloads?