40 ideas
| 22270 | Frege changed philosophy by extending logic's ability to check the grounds of thinking [Potter on Frege] |
| Full Idea: Frege's 1879 logic transformed philosophy because it greatly expanded logic's reach - what thought can achieve unaided - and hence compelled a re-examination of everything previously said about the grounds of thought when logic gives out. | |
| From: comment on Gottlob Frege (Begriffsschrift [1879]) by Michael Potter - The Rise of Analytic Philosophy 1879-1930 Intro | |
| A reaction: I loved the gloss on logic as 'what thought can achieve unaided'. I largely see logic in terms of what is mechanically computable. |
| 8939 | We should not describe human laws of thought, but how to correctly track truth [Frege, by Fisher] |
| Full Idea: Frege disagree that logic should merely describe the laws of thought - how people actually did reason. Logic is essentially normative, not descriptive. We want the one logic which successfully tracks the truth. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Jennifer Fisher - On the Philosophy of Logic 1.III | |
| A reaction: This explains Frege's sustained attack on psychologism, and it also explains we he ended up as a platonist about logic - because he wanted its laws to be valid independently of human thinking. A step too far, perhaps. Brains are truth machines. |
| 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. |
| 4971 | I don't use 'subject' and 'predicate' in my way of representing a judgement [Frege] |
| Full Idea: A distinction of subject and predicate finds no place in my way of representing a judgement. | |
| From: Gottlob Frege (Begriffsschrift [1879], §03) | |
| A reaction: Perhaps this sentence could be taken as the beginning of modern analytical philosophy. The old view doesn't seem to me entirely redundant - merely replaced by a much more detailed analysis of what makes a 'subject' and what makes a 'predicate'. |
| 17745 | For Frege, 'All A's are B's' means that the concept A implies the concept B [Frege, by Walicki] |
| Full Idea: 'All A's are B's' meant for Frege that the concept A implies the concept B, or that to be A implies also to be B. Moreover this applies to arbitrary x which happens to be A. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Michal Walicki - Introduction to Mathematical Logic History D.2 | |
| A reaction: This seems to hit the renate/cordate problem. If all creatures with hearts also have kidneys, does that mean that being enhearted logically implies being kidneyfied? If all chimps are hairy, is that a logical requirement? Is inclusion implication? |
| 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. |
| 7728 | Frege has a judgement stroke (vertical, asserting or judging) and a content stroke (horizontal, expressing) [Frege, by Weiner] |
| Full Idea: Frege distinguished between asserting a proposition and expressing it, and he introduced the judgement stroke (a small vertical line, assertion) and the content stroke (a long horizontal line, expression) to represent them. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Joan Weiner - Frege Ch.3 | |
| A reaction: There are also strokes for conditional and denial. |
| 16881 | The laws of logic are boundless, so we want the few whose power contains the others [Frege] |
| Full Idea: Since in view of the boundless multitude of laws that can be enunciated we cannot list them all, we cannot achieve completeness except by searching out those that, by their power, contain all of them. | |
| From: Gottlob Frege (Begriffsschrift [1879], §13) | |
| A reaction: He refers to these laws in the previous sentence as the 'core'. His talk of 'power' is music to my ears, since it implies a direction of explanation. Burge says the power is that of defining other concepts. |
| 7622 | In 1879 Frege developed second order logic [Frege, by Putnam] |
| Full Idea: By 1879 Frege had discovered an algorithm, a mechanical proof procedure, that embraces what is today standard 'second order logic'. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Hilary Putnam - Reason, Truth and History Ch.5 | |
| A reaction: Note that Frege did more than introduce quantifiers, and the logic of predicates. |
| 7729 | Frege replaced Aristotle's subject/predicate form with function/argument form [Frege, by Weiner] |
| Full Idea: Frege's regimentation is based on the view of the simplest sort of statement as having, not subject/predicate form (as in Aristotle), but function/argument form. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Joan Weiner - Frege | |
| A reaction: This looks like being a crucial move into the modern world, where one piece of information is taken in and dealt with, as in computer procedures. Have educated people reorganised their minds along Fregean lines? |
| 9950 | A quantifier is a second-level predicate (which explains how it contributes to truth-conditions) [Frege, by George/Velleman] |
| Full Idea: The contribution of the quantifier to the truth conditions of sentences of which it is a part cannot be adequately explained if it is treated as other than a second-level predicate (for instance, if it is viewed as name). | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.2 | |
| A reaction: They suggest that this makes it something like a 'property of properties'. With this account it becomes plausible to think of numbers as quantifiers (since they do, after all, specify quantities). |
| 9991 | For Frege the variable ranges over all objects [Frege, by Tait] |
| Full Idea: For Frege the variable ranges over all objects. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by William W. Tait - Frege versus Cantor and Dedekind XII | |
| A reaction: The point is that Frege had not yet seen the necessity to define the domain of quantification, and this leads him into various difficulties. |
| 10536 | Frege's domain for variables is all objects, but modern interpretations first fix the domain [Dummett on Frege] |
| Full Idea: For Frege there is no need to specify the domain of the individual variables, which is taken as the totality of all objects. This contrasts with the standard notion of an interpretation, which demands that we first fix the domain. | |
| From: comment on Gottlob Frege (Begriffsschrift [1879]) by Michael Dummett - Frege Philosophy of Language (2nd ed) Ch.14 | |
| A reaction: What intrigues me is how domains of quantification shift according to context in ordinary usage, even in mid-sentence. I ought to go through every idea in this database, specifying its domain of quantification. Any volunteers? |
| 7730 | Frege introduced quantifiers for generality [Frege, by Weiner] |
| Full Idea: In order to express generality, Frege introduced quantifier notation. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Joan Weiner - Frege | |
| A reaction: This is the birth of predicate logic, beloved of analytical philosophers (but of no apparent interest to phenomenalists, deconstructionists, existentialists?). Generality is what you get from induction (which is, of course, problematic). |
| 7742 | Frege reduced most quantifiers to 'everything' combined with 'not' [Frege, by McCullogh] |
| Full Idea: Frege treated 'everything' as basic, and suggested ways of recasting propositions containing other quantifiers so that this was the only one remaining. He recast 'something' as 'at least one thing', and defined this in terms of 'everything' and 'not'. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Gregory McCullogh - The Game of the Name 1.6 | |
| A reaction: Extreme parsimony seems highly desirable in logic as well as ontology, but it can lead to frustrations, especially over the crucial question of the existence of things quantified over. See Idea 6068. |
| 13824 | Proof theory began with Frege's definition of derivability [Frege, by Prawitz] |
| Full Idea: Frege's formal definition of derivability is perhaps the first investigation in general proof theory. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Dag Prawitz - Gentzen's Analysis of First-Order Proofs 2 n2 | |
| A reaction: In 'On General Proof Theory §1' Prawitz says "proof theory originated with Hilbert" in 1900. Presumably Frege offered a theory, and then Hilbert saw it as a general project. |
| 13609 | Frege produced axioms for logic, though that does not now seem the natural basis for logic [Frege, by Kaplan] |
| Full Idea: Frege's work supplied a set of axioms for logic itself, at least partly because it was a well-known way of presenting the foundations in other disciplines, especially mathematics, but it does not nowadays strike us as natural for logic. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by David Kaplan - Dthat 5.1 | |
| A reaction: What Bostock has in mind is the so-called 'natural' deduction systems, which base logic on rules of entailment, rather than on a set of truths. The axiomatic approach uses a set of truths, plus the idea of possible contradictions. |
| 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 |
| 17855 | It may be possible to define induction in terms of the ancestral relation [Frege, by Wright,C] |
| Full Idea: Frege's account of the ancestral has made it possible, in effect, to define the natural numbers as entities for which induction holds. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Crispin Wright - Frege's Concept of Numbers as Objects 4.xix | |
| A reaction: This is the opposite of the approach in the Peano Axioms, where induction is used to define the natural numbers. |
| 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. |
| 10607 | Frege's logic has a hierarchy of object, property, property-of-property etc. [Frege, by Smith,P] |
| Full Idea: Frege's general logical system involves a type hierarchy, distinguishing objects from properties from properties-of-properties etc., with every item belonging to a determinate level. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Peter Smith - Intro to Gödel's Theorems 14.1 | |
| A reaction: The Theory of Types went on to apply this hierarchy to classes, where Frege's disastrous Basic Law V flattens the hierarchy of classes, putting them on the same level (Smith p.119) |
| 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. |
| 11008 | Existence is not a first-order property, but the instantiation of a property [Frege, by Read] |
| Full Idea: When Kant said that existence was not a property, what he meant was, according to Frege, that existence is not a first-order property - it is not a property of individuals but a property of properties, that the property has an instance. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Stephen Read - Thinking About Logic Ch.5 |
| 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. |
| 22280 | Frege's account was top-down and decompositional, not bottom-up and compositional [Frege, by Potter] |
| Full Idea: Frege's account was top-down, not bottom-up: he aimed to decompose and discern function-argument structure in already existing sentences, not to explain how those sentences acquired their meanings in the first place. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Michael Potter - The Rise of Analytic Philosophy 1879-1930 03 'Func' | |
| A reaction: This goes with the holistic account of meaning, which leads to Quine's gavagai and Kuhn's obfuscation of science. I recommend compositionality for everthing. |
| 1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
| Full Idea: Archelaus was the first person to say that the universe is boundless. | |
| From: report of Archelaus (fragments/reports [c.450 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 02.Ar.3 |
| 5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |
| Full Idea: Archelaus wrote that life on Earth began in a primeval slime. | |
| From: report of Archelaus (fragments/reports [c.450 BCE]) by Malcolm Schofield - Archelaus | |
| A reaction: This sounds like a fairly clearcut assertion of the production of life by evolution. Darwin's contribution was to propose the mechanism for achieving it. We should honour the name of Archelaus for this idea. |
| 7741 | The predicate 'exists' is actually a natural language expression for a quantifier [Frege, by Weiner] |
| Full Idea: On Frege's logical analysis, the predicate 'exists' is actually a natural language expression for a quantifier. | |
| From: report of Gottlob Frege (Begriffsschrift [1879]) by Joan Weiner - Frege Ch.8 | |
| A reaction: However see Idea 6067, for McGinn's alternative view of quantifiers. In the normal conventions of predicate logic it may be that existence is treated as a quantifier, but that is not the same as saying that existence just IS a quantifier. |