29 ideas
| 21752 | Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine] |
| Full Idea: Gödel's proof wrought an abrupt turn in the philosophy of mathematics. We had supposed that truth, in mathematics, consisted in provability. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Willard Quine - Forward to Gödel's Unpublished | |
| A reaction: This explains the crisis in the early 1930s, which Tarski's theory appeared to solve. |
| 17835 | Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M] |
| Full Idea: Gödel's incompleteness results of 1931 show that all axiom systems precise enough to satisfy Hilbert's conception are necessarily incomplete. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Michael Hallett - Introduction to Zermelo's 1930 paper p.1215 | |
| A reaction: [Hallett italicises 'necessarily'] Hilbert axioms have to be recursive - that is, everything in the system must track back to them. |
| 18739 | Three stages of philosophical logic: syntactic (1905-55), possible worlds (1963-85), widening (1990-) [Horsten/Pettigrew] |
| Full Idea: Three periods can be distinguished in philosophical logic: the syntactic stage, from Russell's definite descriptions to the 1950s, the dominance of possible world semantics from the 50s to 80s, and a current widening of the subject. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 1) | |
| A reaction: [compressed] I've read elsewhere that the arrival of Tarski's account of truth in 1933, taking things beyond the syntactic, was also a landmark. |
| 18741 | Logical formalization makes concepts precise, and also shows their interrelation [Horsten/Pettigrew] |
| Full Idea: Logical formalization forces the investigator to make the central philosophical concepts precise. It can also show how some philosophical concepts and objects can be defined in terms of others. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 2) | |
| A reaction: This is the main rationale of the highly formal and mathematical approach to such things. The downside is when you impose 'precision' on language that was never intended to be precise. |
| 18744 | Models are sets with functions and relations, and truth built up from the components [Horsten/Pettigrew] |
| Full Idea: A (logical) model is a set with functions and relations defined on it that specify the denotation of the non-logical vocabulary. A series of recursive clauses explicate how truth values of complex sentences are compositionally determined from the parts. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 3) | |
| A reaction: See the ideas on 'Functions in logic' and 'Relations in logic' (in the alphabetical list) to expand this important idea. |
| 17886 | The limitations of axiomatisation were revealed by the incompleteness theorems [Gödel, by Koellner] |
| Full Idea: The inherent limitations of the axiomatic method were first brought to light by the incompleteness theorems. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Koellner - On the Question of Absolute Undecidability 1.1 |
| 10071 | Second Incompleteness: nice theories can't prove their own consistency [Gödel, by Smith,P] |
| Full Idea: Second Incompleteness Theorem: roughly, nice theories that include enough basic arithmetic can't prove their own consistency. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 1.5 | |
| A reaction: On the face of it, this sounds less surprising than the First Theorem. Philosophers have often noticed that it seems unlikely that you could use reason to prove reason, as when Descartes just relies on 'clear and distinct ideas'. |
| 19123 | If soundness can't be proved internally, 'reflection principles' can be added to assert soundness [Gödel, by Halbach/Leigh] |
| Full Idea: Gödel showed PA cannot be proved consistent from with PA. But 'reflection principles' can be added, which are axioms partially expressing the soundness of PA, by asserting what is provable. A Global Reflection Principle asserts full soundness. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Halbach,V/Leigh,G.E. - Axiomatic Theories of Truth (2013 ver) 1.2 | |
| A reaction: The authors point out that this needs a truth predicate within the language, so disquotational truth won't do, and there is a motivation for an axiomatic theory of truth. |
| 10621 | Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel] |
| Full Idea: Where Gödel's First Theorem sabotages logicist ambitions, the Second Theorem sabotages Hilbert's Programme. | |
| From: comment on Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 36 | |
| A reaction: Neo-logicism (Crispin Wright etc.) has a strategy for evading the First Theorem. |
| 17888 | The undecidable sentence can be decided at a 'higher' level in the system [Gödel] |
| Full Idea: My undecidable arithmetical sentence ...is not at all absolutely undecidable; rather, one can always pass to 'higher' systems in which the sentence in question is decidable. | |
| From: Kurt Gödel (On Formally Undecidable Propositions [1931]), quoted by Peter Koellner - On the Question of Absolute Undecidability 1.1 | |
| A reaction: [a 1931 MS] He says the reals are 'higher' than the naturals, and the axioms of set theory are higher still. The addition of a truth predicate is part of what makes the sentence become decidable. |
| 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 |
| 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. |
| 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. |
| 18740 | If 'exist' doesn't express a property, we can hardly ask for its essence [Horsten/Pettigrew] |
| Full Idea: If there is indeed no property of existence that is expressed by the word 'exist', then it makes no sense to ask for its essence. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 2) | |
| A reaction: As far as I can tell, this was exactly Aristotle's conclusion, so he skirted round the question of 'being qua being', and focused on the nature of objects instead. Grand continental talk of 'Being' doesn't sound very interesting. |
| 13432 | The essence of a circle is the equality of its radii [Leibniz] |
| Full Idea: The essence of a circle consists in the equality of all lines drawn from its centre to its circumference. | |
| From: Gottfried Leibniz (Letters to Thomasius [1669], 1669) | |
| A reaction: Compare Locke in Idea 13431 and Spinoza in Idea 13073 on the essence of geometrical figures. A key question is whether the essence is in the simplest definition, or in a complex and wide-ranging account, e.g. including conic sections for circles. |
| 18745 | A Tarskian model can be seen as a possible state of affairs [Horsten/Pettigrew] |
| Full Idea: A Tarskian model can in a sense be seen as a model of a possible state of affairs. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 3) | |
| A reaction: I include this remark to show how possible worlds semantics built on the arrival of model theory. |
| 18747 | The 'spheres model' was added to possible worlds, to cope with counterfactuals [Horsten/Pettigrew] |
| Full Idea: The notion of a possible worlds model was extended (resulting in the concept of a 'spheres model') in order to obtain a satisfactory logical treatment of counterfactual conditional sentences. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 4) | |
| A reaction: Thus we add 'centred' worlds, and an 'actual' world, to the loose original model. It is important to remember when we discuss 'close' worlds that we are then committed to these presuppositions. |
| 18748 | Epistemic logic introduced impossible worlds [Horsten/Pettigrew] |
| Full Idea: The idea of 'impossible worlds' was introduced into epistemic logic. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 4) | |
| A reaction: Nathan Salmon seems interested in their role in metaphysics (presumably in relation to Meinongian impossible objects, like circular squares, which must necessarily be circular). |
| 18746 | Possible worlds models contain sets of possible worlds; this is a large metaphysical commitment [Horsten/Pettigrew] |
| Full Idea: Each possible worlds model contains a set of possible worlds. For this reason, possible worlds semantics is often charged with smuggling in heavy metaphysical commitments. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 3) | |
| A reaction: To a beginner it looks very odd that you should try to explain possibility by constructing a model of it in terms of 'possible' worlds. |
| 18750 | Using possible worlds for knowledge and morality may be a step too far [Horsten/Pettigrew] |
| Full Idea: When the possible worlds semantics were further extended to model notions of knowledge and of moral obligation, the application was beginning to look distinctly forced and artificial. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 5) | |
| A reaction: They accept lots of successes in modelling necessity and time. |
| 3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |
| Full Idea: Gödel in his completeness theorem for first-order logic showed that a certain set of syntactically specifiable rules was adequate to capture all first-order valid arguments. No semantics (e.g. reference, truth, validity) was necessary. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Georges Rey - Contemporary Philosophy of Mind 8.2 | |
| A reaction: This implies that a logic machine is possible, but we shouldn't raise our hopes for proper rationality. Validity can be shown for purely algebraic arguments, but rationality requires truth as well as validity, and that needs propositions and semantics. |
| 12696 | Bodies are recreated in motion, and don't exist in intervening instants [Leibniz] |
| Full Idea: I have demonstrated that whatever moves is continuously created and that bodies are nothing at any time between the instants in motion. | |
| From: Gottfried Leibniz (Letters to Thomasius [1669], 1669.04), quoted by Daniel Garber - Leibniz:Body,Substance,Monad 1 | |
| A reaction: Leibniz is a little over-confident about what he has 'demonstrated', but I think (from this remark) that he would not have been displeased with quantum theory, and the notion of a 'quantum leap' and a 'Planck time'. A 'conatus' is a 'smallest motion'. |