Book contents
- Frontmatter
- Contents
- Preface
- 1 What Gödel's Theorems say
- 2 Decidability and enumerability
- 3 Axiomatized formal theories
- 4 Capturing numerical properties
- 5 The truths of arithmetic
- 6 Sufficiently strong arithmetics
- 7 Interlude: Taking stock
- 8 Two formalized arithmetics
- 9 What Q can prove
- 10 First-order Peano Arithmetic
- 11 Primitive recursive functions
- 12 Capturing p.r. functions
- 13 Q is p.r. adequate
- 14 Interlude: A very little about Principia
- 15 The arithmetization of syntax
- 16 PA is incomplete
- 17 Gödel's First Theorem
- 18 Interlude: About the First Theorem
- 19 Strengthening the First Theorem
- 20 The Diagonalization Lemma
- 21 Using the Diagonalization Lemma
- 22 Second-order arithmetics
- 23 Interlude: Incompleteness and Isaacson's conjecture
- 24 Gödel's Second Theorem for PA
- 25 The derivability conditions
- 26 Deriving the derivability conditions
- 27 Reflections
- 28 Interlude: About the Second Theorem
- 29 µ-Recursive functions
- 30 Undecidability and incompleteness
- 31 Turing machines
- 32 Turing machines and recursiveness
- 33 Halting problems
- 34 The Church–Turing Thesis
- 35 Proving the Thesis?
- 36 Looking back
- Further reading
- Bibliography
- Index
28 - Interlude: About the Second Theorem
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- Preface
- 1 What Gödel's Theorems say
- 2 Decidability and enumerability
- 3 Axiomatized formal theories
- 4 Capturing numerical properties
- 5 The truths of arithmetic
- 6 Sufficiently strong arithmetics
- 7 Interlude: Taking stock
- 8 Two formalized arithmetics
- 9 What Q can prove
- 10 First-order Peano Arithmetic
- 11 Primitive recursive functions
- 12 Capturing p.r. functions
- 13 Q is p.r. adequate
- 14 Interlude: A very little about Principia
- 15 The arithmetization of syntax
- 16 PA is incomplete
- 17 Gödel's First Theorem
- 18 Interlude: About the First Theorem
- 19 Strengthening the First Theorem
- 20 The Diagonalization Lemma
- 21 Using the Diagonalization Lemma
- 22 Second-order arithmetics
- 23 Interlude: Incompleteness and Isaacson's conjecture
- 24 Gödel's Second Theorem for PA
- 25 The derivability conditions
- 26 Deriving the derivability conditions
- 27 Reflections
- 28 Interlude: About the Second Theorem
- 29 µ-Recursive functions
- 30 Undecidability and incompleteness
- 31 Turing machines
- 32 Turing machines and recursiveness
- 33 Halting problems
- 34 The Church–Turing Thesis
- 35 Proving the Thesis?
- 36 Looking back
- Further reading
- Bibliography
- Index
Summary
The title of Gödel's great paper is ‘On formally undecidable propositions of Principia Mathematica and related systems I’. And as we noted in Section 18.5, his First Incompleteness Theorem does indeed undermine Principia's logicist ambitions. But logicism wasn't really Gödel's main target. For, by 1931, much of the steam had already gone out of the logicist project. Instead, the dominant project for showing that classical infinitary mathematics is in good order was Hilbert's Programme, which we have already mentioned a few times. This provided the real impetus for Gödel's early work; it is time we filled out just a bit more of the story.
However, this book certainly isn't the place for a detailed treatment of the changing ideas of Hilbert and his followers as their ideas developed pre- and post-Gödel; nor is it the place for an extended discussion of the later fate of Hilbertian ideas. So our necessarily brief remarks will do no more than sketch the logical geography of some broadly Hilbertian territory: those with more of a bent for the history of logic can be left to fight over e.g. the question of Hilbert's precise path through the landscape.
Another topic we'll take up in this Interlude is the vexed one of the impact of the incompleteness theorems, and in particular the Second Theorem, on the issue of mechanism: do Gödelian results show that minds cannot be machines?
- Type
- Chapter
- Information
- An Introduction to Gödel's Theorems , pp. 252 - 264Publisher: Cambridge University PressPrint publication year: 2007