display all the ideas for this combination of texts
2 ideas
| 17883 | Gödel's Theorems did not refute the claim that all good mathematical questions have answers [Gödel, by Koellner] |
| Full Idea: Gödel was quick to point out that his original incompleteness theorems did not produce instances of absolute undecidability and hence did not undermine Hilbert's conviction that for every precise mathematical question there is a discoverable answer. | |
| From: report of Kurt Gödel (works [1930]) by Peter Koellner - On the Question of Absolute Undecidability Intro | |
| A reaction: The normal simplistic view among philosophes is that Gödel did indeed decisively refute the optimistic claims of Hilbert. Roughly, whether Hilbert is right depends on which axioms of set theory you adopt. |
| 10082 | There are infinite sets that are not enumerable [Cantor, by Smith,P] |
| Full Idea: Cantor's Theorem (1874) says there are infinite sets that are not enumerable. This is proved by his 1891 'diagonal argument'. | |
| From: report of George Cantor (works [1880]) by Peter Smith - Intro to Gödel's Theorems 2.3 | |
| A reaction: [Smith summarises the diagonal argument] |