30 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. |
| 10807 | Mathematics reduces to set theory, which reduces, with some mereology, to the singleton function [Lewis] |
| Full Idea: It is generally accepted that mathematics reduces to set theory, and I argue that set theory in turn reduces, with some aid of mereology, to the theory of the singleton function. | |
| From: David Lewis (Mathematics is Megethology [1993], p.03) |
| 10809 | We can accept the null set, but not a null class, a class lacking members [Lewis] |
| Full Idea: In my usage of 'class', there is no such things as the null class. I don't mind calling some memberless thing - some individual - the null set. But that doesn't make it a memberless class. Rather, that makes it a 'set' that is not a class. | |
| From: David Lewis (Mathematics is Megethology [1993], p.05) | |
| A reaction: Lewis calls this usage 'idiosyncratic', but it strikes me as excellent. Set theorists can have their vital null class, and sensible people can be left to say, with Lewis, that classes of things must have members. |
| 10811 | The null set plays the role of last resort, for class abstracts and for existence [Lewis] |
| Full Idea: The null set serves two useful purposes. It is a denotation of last resort for class abstracts that denote no nonempty class. And it is an individual of last resort: we can count on its existence, and fearlessly build the hierarchy of sets from it. | |
| From: David Lewis (Mathematics is Megethology [1993], p.09) | |
| A reaction: This passage assuages my major reservation about the existence of the null set, but at the expense of confirming that it must be taken as an entirely fictional entity. |
| 10812 | The null set is not a little speck of sheer nothingness, a black hole in Reality [Lewis] |
| Full Idea: Should we accept the null set as a most extraordinary individual, a little speck of sheer nothingness, a sort of black hole in the fabric of Reality itself? Not that either, I think. | |
| From: David Lewis (Mathematics is Megethology [1993], p.09) | |
| A reaction: Correct! |
| 10813 | What on earth is the relationship between a singleton and an element? [Lewis] |
| Full Idea: A new student of set theory has just one thing, the element, and he has another single thing, the singleton, and not the slightest guidance about what one thing has to do with the other. | |
| From: David Lewis (Mathematics is Megethology [1993], p.12) |
| 10814 | Are all singletons exact intrinsic duplicates? [Lewis] |
| Full Idea: Are all singletons exact intrinsic duplicates? | |
| From: David Lewis (Mathematics is Megethology [1993], p.13) |
| 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. |
| 10806 | Megethology is the result of adding plural quantification to mereology [Lewis] |
| Full Idea: Megethology is the result of adding plural quantification, as advocated by George Boolos, to the language of mereology. | |
| From: David Lewis (Mathematics is Megethology [1993], p.03) |
| 10816 | We can use mereology to simulate quantification over relations [Lewis] |
| Full Idea: We can simulate quantification over relations using megethology. Roughly, a quantifier over relations is a plural quantifier over things that encode ordered pairs by mereological means. | |
| From: David Lewis (Mathematics is Megethology [1993], p.18) | |
| A reaction: [He credits this idea to Burgess and Haven] The point is to avoid second-order logic, which quantifies over relations as ordered n-tuple sets. |
| 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 |
| 10808 | Mathematics is generalisations about singleton functions [Lewis] |
| Full Idea: We can take the theory of singleton functions, and hence set theory, and hence mathematics, to consist of generalisations about all singleton functions. | |
| From: David Lewis (Mathematics is Megethology [1993], p.03) | |
| A reaction: At first glance this sounds like a fancy version of the somewhat discredited Greek idea that mathematics is built on the concept of a 'unit'. |
| 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. |
| 10815 | We don't need 'abstract structures' to have structural truths about successor functions [Lewis] |
| Full Idea: We needn't believe in 'abstract structures' to have general structural truths about all successor functions. | |
| From: David Lewis (Mathematics is Megethology [1993], p.16) |
| 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. |
| 10810 | I say that absolutely any things can have a mereological fusion [Lewis] |
| Full Idea: I accept the principle of Unrestricted Composition: whenever there are some things, no matter how many or how unrelated or how disparate in character they may be, they have a mereological fusion. ...The trout-turkey is part fish and part fowl. | |
| From: David Lewis (Mathematics is Megethology [1993], p.07) | |
| A reaction: This nicely ducks the question of when things form natural wholes and when they don't, but I would have thought that that might be one of the central issues of metaphysicals, so I think I'll give Lewis's principle a miss. |
| 18284 | Particulars can be verified or falsified, but general statements can only be falsified (conclusively) [Popper] |
| Full Idea: Whereas particular reality statements are in principle completely verifiable or falsifiable, things are different for general reality statements: they can indeed be conclusively falsified, they can acquire a negative truth value, but not a positive one. | |
| From: Karl Popper (Two Problems of Epistemology [1932], p.256), quoted by J. Alberto Coffa - The Semantic Tradition from Kant to Carnap 18 'Laws' | |
| A reaction: This sounds like a logician's approach to science, but I prefer to look at coherence, where very little is actually conclusive, and one tinkers with the theory instead. |
| 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. |