display all the ideas for this combination of philosophers
19 ideas
| 10132 | There can be no single consistent theory from which all mathematical truths can be derived [Gödel, by George/Velleman] |
| Full Idea: Gödel's far-reaching work on the nature of logic and formal systems reveals that there can be no single consistent theory from which all mathematical truths can be derived. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.8 |
| 10046 | The generalized Continuum Hypothesis asserts a discontinuity in cardinal numbers [Gödel] |
| Full Idea: The generalized Continuum Hypothesis says that there exists no cardinal number between the power of any arbitrary set and the power of the set of its subsets. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.464) |
| 10868 | The Continuum Hypothesis is not inconsistent with the axioms of set theory [Gödel, by Clegg] |
| Full Idea: Gödel proved that the Continuum Hypothesis was not inconsistent with the axioms of set theory. | |
| From: report of Kurt Gödel (What is Cantor's Continuum Problem? [1964]) by Brian Clegg - Infinity: Quest to Think the Unthinkable Ch.15 |
| 13517 | If set theory is consistent, we cannot refute or prove the Continuum Hypothesis [Gödel, by Hart,WD] |
| Full Idea: Gödel proved that (if set theory is consistent) we cannot refute the continuum hypothesis, and Cohen proved that (if set theory is consistent) we cannot prove it either. | |
| From: report of Kurt Gödel (What is Cantor's Continuum Problem? [1964]) by William D. Hart - The Evolution of Logic 10 |
| 17885 | Gödel eventually hoped for a generalised completeness theorem leaving nothing undecidable [Gödel, by Koellner] |
| Full Idea: Eventually Gödel ...expressed the hope that there might be a generalised completeness theorem according to which there are no absolutely undecidable sentences. | |
| From: report of Kurt Gödel (works [1930]) by Peter Koellner - On the Question of Absolute Undecidability Intro | |
| A reaction: This comes as a bit of a shock to those who associate him with the inherent undecidability of reality. |
| 10614 | The real reason for Incompleteness in arithmetic is inability to define truth in a language [Gödel] |
| Full Idea: The concept of truth of sentences in a language cannot be defined in the language. This is the true reason for the existence of undecidable propositions in the formal systems containing arithmetic. | |
| From: Kurt Gödel (works [1930]), quoted by Peter Smith - Intro to Gödel's Theorems 21.6 | |
| A reaction: [from a letter by Gödel] So they key to Incompleteness is Tarski's observations about truth. Highly significant, as I take it. |
| 3198 | Gödel showed that arithmetic is either incomplete or inconsistent [Gödel, by Rey] |
| Full Idea: Gödel's theorem states that either arithmetic is incomplete, or it is inconsistent. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Georges Rey - Contemporary Philosophy of Mind 8.7 |
| 10072 | First Incompleteness: arithmetic must always be incomplete [Gödel, by Smith,P] |
| Full Idea: First Incompleteness Theorem: any properly axiomatised and consistent theory of basic arithmetic must remain incomplete, whatever our efforts to complete it by throwing further axioms into the mix. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 1.2 | |
| A reaction: This is because it is always possible to formulate a well-formed sentence which is not provable within the theory. |
| 9590 | Arithmetical truth cannot be fully and formally derived from axioms and inference rules [Gödel, by Nagel/Newman] |
| Full Idea: The vast continent of arithmetical truth cannot be brought into systematic order by laying down a fixed set of axioms and rules of inference from which every true mathematical statement can be formally derived. For some this was a shocking revelation. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by E Nagel / JR Newman - Gödel's Proof VII.C | |
| A reaction: Good news for philosophy, I'd say. The truth cannot be worked out by mechanical procedures, so it needs the subtle and intuitive intelligence of your proper philosopher (Parmenides is the role model) to actually understand reality. |
| 11069 | Gödel's Second says that semantic consequence outruns provability [Gödel, by Hanna] |
| Full Idea: Gödel's Second Incompleteness Theorem says that true unprovable sentences are clearly semantic consequences of the axioms in the sense that they are necessarily true if the axioms are true. So semantic consequence outruns provability. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Robert Hanna - Rationality and Logic 5.3 |
| 10118 | First Incompleteness: a decent consistent system is syntactically incomplete [Gödel, by George/Velleman] |
| Full Idea: First Incompleteness Theorem: If S is a sufficiently powerful formal system, then if S is consistent then S is syntactically incomplete. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.6 | |
| A reaction: Gödel found a single sentence, effectively saying 'I am unprovable in S', which is neither provable nor refutable in S. |
| 10122 | Second Incompleteness: a decent consistent system can't prove its own consistency [Gödel, by George/Velleman] |
| Full Idea: Second Incompleteness Theorem: If S is a sufficiently powerful formal system, then if S is consistent then S cannot prove its own consistency | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.6 | |
| A reaction: This seems much less surprising than the First Theorem (though it derives from it). It was always kind of obvious that you couldn't use reason to prove that reason works (see, for example, the Cartesian Circle). |
| 10611 | There is a sentence which a theory can show is true iff it is unprovable [Gödel, by Smith,P] |
| Full Idea: The original Gödel construction gives us a sentence that a theory shows is true if and only if it satisfies the condition of being unprovable-in-that-theory. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 20.5 |
| 10867 | 'This system can't prove this statement' makes it unprovable either way [Gödel, by Clegg] |
| Full Idea: An approximation of Gödel's Theorem imagines a statement 'This system of mathematics can't prove this statement true'. If the system proves the statement, then it can't prove it. If the statement can't prove the statement, clearly it still can't prove it. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Brian Clegg - Infinity: Quest to Think the Unthinkable Ch.15 | |
| A reaction: Gödel's contribution to this simple idea seems to be a demonstration that formal arithmetic is capable of expressing such a statement. |
| 10039 | Some arithmetical problems require assumptions which transcend arithmetic [Gödel] |
| Full Idea: It has turned out that the solution of certain arithmetical problems requires the use of assumptions essentially transcending arithmetic. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.449) | |
| A reaction: A nice statement of the famous result, from the great man himself, in the plainest possible English. |
| 10043 | Mathematical objects are as essential as physical objects are for perception [Gödel] |
| Full Idea: Classes and concepts may be conceived of as real objects, ..and are as necessary to obtain a satisfactory system of mathematics as physical bodies are necessary for a satisfactory theory of our sense perceptions, with neither case being about 'data'. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.456) | |
| A reaction: Note that while he thinks real objects are essential for mathematics, be may not be claiming the same thing for our knowledge of logic. If logic contains no objects, then how could mathematics be reduced to it, as in logicism? |
| 10271 | Basic mathematics is related to abstract elements of our empirical ideas [Gödel] |
| Full Idea: Evidently the 'given' underlying mathematics is closely related to the abstract elements contained in our empirical ideas. | |
| From: Kurt Gödel (What is Cantor's Continuum Problem? [1964], Suppl) | |
| A reaction: Yes! The great modern mathematical platonist says something with which I can agree. He goes on to hint at a platonic view of the structure of the empirical world, but we'll let that pass. |
| 10045 | Impredicative definitions are admitted into ordinary mathematics [Gödel] |
| Full Idea: Impredicative definitions are admitted into ordinary mathematics. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.464) | |
| A reaction: The issue is at what point in building an account of the foundations of mathematics (if there be such, see Putnam) these impure definitions should be ruled out. |
| 8747 | Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro] |
| Full Idea: Gödel defended impredicative definitions on grounds of ontological realism. From that perspective, an impredicative definition is a description of an existing entity with reference to other existing entities. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Stewart Shapiro - Thinking About Mathematics 5.3 | |
| A reaction: This is why constructivists must be absolutely precise about definition, where realists only have to do their best. Compare building a car with painting a landscape. |