32 ideas
| 5831 | The new view is that "water" is a name, and has no definition [Schwartz,SP] |
| Full Idea: Perhaps the modern view is best expressed as saying that "water" has no definition at all, at least in the traditional sense, and is a proper name of a specific substance. | |
| From: Stephen P. Schwartz (Intro to Naming,Necessity and Natural Kinds [1977], §III) | |
| A reaction: This assumes that proper names have no definitions, though I am not clear how we can grasp the name 'Aristotle' without some association of properties (human, for example) to go with it. We need a definition of 'definition'. |
| 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. |
| 10482 | The logic of ZF is classical first-order predicate logic with identity [Boolos] |
| Full Idea: The logic of ZF Set Theory is classical first-order predicate logic with identity. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.121) | |
| A reaction: This logic seems to be unable to deal with very large cardinals, precisely those that are implied by set theory, so there is some sort of major problem hovering here. Boolos is fairly neutral. |
| 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. |
| 10492 | A few axioms of set theory 'force themselves on us', but most of them don't [Boolos] |
| Full Idea: Maybe the axioms of extensionality and the pair set axiom 'force themselves on us' (Gödel's phrase), but I am not convinced about the axioms of infinity, union, power or replacement. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.130) | |
| A reaction: Boolos is perfectly happy with basic set theory, but rather dubious when very large cardinals come into the picture. |
| 10485 | Naďve sets are inconsistent: there is no set for things that do not belong to themselves [Boolos] |
| Full Idea: The naďve view of set theory (that any zero or more things form a set) is natural, but inconsistent: the things that do not belong to themselves are some things that do not form a set. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.127) | |
| A reaction: As clear a summary of Russell's Paradox as you could ever hope for. |
| 10484 | The iterative conception says sets are formed at stages; some are 'earlier', and must be formed first [Boolos] |
| Full Idea: According to the iterative conception, every set is formed at some stage. There is a relation among stages, 'earlier than', which is transitive. A set is formed at a stage if and only if its members are all formed before that stage. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.126) | |
| A reaction: He gives examples of the early stages, and says the conception is supposed to 'justify' Zermelo set theory. It is also supposed to make the axioms 'natural', rather than just being selected for convenience. And it is consistent. |
| 5829 | We refer to Thales successfully by name, even if all descriptions of him are false [Schwartz,SP] |
| Full Idea: We can refer to Thales by using the name "Thales" even though perhaps the only description we can supply is false of him. | |
| From: Stephen P. Schwartz (Intro to Naming,Necessity and Natural Kinds [1977], §III) | |
| A reaction: It is not clear what we would be referring to if all of our descriptions (even 'Greek philosopher') were false. If an archaeologist finds just a scrap of stone with a name written on it, that is hardly a sufficient basis for successful reference. |
| 5830 | The traditional theory of names says some of the descriptions must be correct [Schwartz,SP] |
| Full Idea: The traditional theory of proper names entails that at least some combination of the things ordinarily believed of Aristotle are necessarily true of him. | |
| From: Stephen P. Schwartz (Intro to Naming,Necessity and Natural Kinds [1977], §III) | |
| A reaction: Searle endorses this traditional theory. Kripke and co. tried to dismiss it, but you can't. If all descriptions of Aristotle turned out to be false (it was actually the name of a Persian statue), our modern references would have been unsuccessful. |
| 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 |
| 10491 | Infinite natural numbers is as obvious as infinite sentences in English [Boolos] |
| Full Idea: The existence of infinitely many natural numbers seems to me no more troubling than that of infinitely many computer programs or sentences of English. There is, for example, no longest sentence, since any number of 'very's can be inserted. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.129) | |
| A reaction: If you really resisted an infinity of natural numbers, presumably you would also resist an actual infinity of 'very's. The fact that it is unclear what could ever stop a process doesn't guarantee that the process is actually endless. |
| 10483 | Mathematics and science do not require very high orders of infinity [Boolos] |
| Full Idea: To the best of my knowledge nothing in mathematics or science requires the existence of very high orders of infinity. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.122) | |
| A reaction: He is referring to particular high orders of infinity implied by set theory. Personally I want to wield Ockham's Razor. Is being implied by set theory a sufficient reason to accept such outrageous entities into our ontology? |
| 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. |
| 10490 | Mathematics isn't surprising, given that we experience many objects as abstract [Boolos] |
| Full Idea: It is no surprise that we should be able to reason mathematically about many of the things we experience, for they are already 'abstract'. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.129) | |
| A reaction: He has just given a list of exemplary abstract objects (Idea 10489), but I think there is a more interesting idea here - that our experience of actual physical objects is to some extent abstract, as soon as it is conceptualised. |
| 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. |
| 10488 | It is lunacy to think we only see ink-marks, and not word-types [Boolos] |
| Full Idea: It's a kind of lunacy to think that sound scientific philosophy demands that we think that we see ink-tracks but not words, i.e. word-types. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.128) | |
| A reaction: This seems to link him with Armstrong's mockery of 'ostrich nominalism'. There seems to be some ambiguity with the word 'see' in this disagreement. When we look at very ancient scratches on stones, why don't we always 'see' if it is words? |
| 10487 | I am a fan of abstract objects, and confident of their existence [Boolos] |
| Full Idea: I am rather a fan of abstract objects, and confident of their existence. Smaller numbers, sets and functions don't offend my sense of reality. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.128) | |
| A reaction: The great Boolos is rather hard to disagree with, but I disagree. Logicians love abstract objects, indeed they would almost be out of a job without them. It seems to me they smuggle them into our ontology by redefining either 'object' or 'exists'. |
| 10489 | We deal with abstract objects all the time: software, poems, mistakes, triangles.. [Boolos] |
| Full Idea: We twentieth century city dwellers deal with abstract objects all the time, such as bank balances, radio programs, software, newspaper articles, poems, mistakes, triangles. | |
| From: George Boolos (Must We Believe in Set Theory? [1997], p.129) | |
| A reaction: I find this claim to be totally question-begging, and typical of a logician. The word 'object' gets horribly stretched in these discussions. We can create concepts which have all the logical properties of objects. Maybe they just 'subsist'? |
| 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. |
| 5826 | The intension of "lemon" is the conjunction of properties associated with it [Schwartz,SP] |
| Full Idea: The conjunction of properties associated with a term such as "lemon" is often called the intension of the term "lemon". | |
| From: Stephen P. Schwartz (Intro to Naming,Necessity and Natural Kinds [1977], §II) | |
| A reaction: The extension of "lemon" is the set of all lemons. At last, a clear explanation of the word 'intension'! The debate becomes clear - over whether the terms of a language are used in reference to ideas of properties (and substances?), or to external items. |