31 ideas
| 13520 | A 'tautology' must include connectives [Wolf,RS] |
| Full Idea: 'For every number x, x = x' is not a tautology, because it includes no connectives. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.2) |
| 13524 | Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS] |
| Full Idea: Deduction Theorem: If T ∪ {P} |- Q, then T |- (P → Q). This is the formal justification of the method of conditional proof (CPP). Its converse holds, and is essentially modus ponens. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.3) |
| 13522 | Universal Generalization: If we prove P(x) with no special assumptions, we can conclude ∀xP(x) [Wolf,RS] |
| Full Idea: Universal Generalization: If we can prove P(x), only assuming what sort of object x is, we may conclude ∀xP(x) for the same x. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.3) | |
| A reaction: This principle needs watching closely. If you pick one person in London, with no presuppositions, and it happens to be a woman, can you conclude that all the people in London are women? Fine in logic and mathematics, suspect in life. |
| 13521 | Universal Specification: ∀xP(x) implies P(t). True for all? Then true for an instance [Wolf,RS] |
| Full Idea: Universal Specification: from ∀xP(x) we may conclude P(t), where t is an appropriate term. If something is true for all members of a domain, then it is true for some particular one that we specify. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.3) |
| 13523 | Existential Generalization (or 'proof by example'): if we can say P(t), then we can say something is P [Wolf,RS] |
| Full Idea: Existential Generalization (or 'proof by example'): From P(t), where t is an appropriate term, we may conclude ∃xP(x). | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.3) | |
| A reaction: It is amazing how often this vacuous-sounding principles finds itself being employed in discussions of ontology, but I don't quite understand why. |
| 13529 | Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS] |
| Full Idea: Empty Set Axiom: ∃x ∀y ¬ (y ∈ x). There is a set x which has no members (no y's). The empty set exists. There is a set with no members, and by extensionality this set is unique. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 2.3) | |
| A reaction: A bit bewildering for novices. It says there is a box with nothing in it, or a pair of curly brackets with nothing between them. It seems to be the key idea in set theory, because it asserts the idea of a set over and above any possible members. |
| 13526 | Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS] |
| Full Idea: The comprehension axiom says that any collection of objects that can be clearly specified can be considered to be a set. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 2.2) | |
| A reaction: This is virtually tautological, since I presume that 'clearly specified' means pinning down exact which items are the members, which is what a set is (by extensionality). The naïve version is, of course, not so hot. |
| 13534 | In first-order logic syntactic and semantic consequence (|- and |=) nicely coincide [Wolf,RS] |
| Full Idea: One of the most appealing features of first-order logic is that the two 'turnstiles' (the syntactic single |-, and the semantic double |=), which are the two reasonable notions of logical consequence, actually coincide. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.3) | |
| A reaction: In the excitement about the possibility of second-order logic, plural quantification etc., it seems easy to forget the virtues of the basic system that is the target of the rebellion. The issue is how much can be 'expressed' in first-order logic. |
| 13535 | First-order logic is weakly complete (valid sentences are provable); we can't prove every sentence or its negation [Wolf,RS] |
| Full Idea: The 'completeness' of first order-logic does not mean that every sentence or its negation is provable in first-order logic. We have instead the weaker result that every valid sentence is provable. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.3) | |
| A reaction: Peter Smith calls the stronger version 'negation completeness'. |
| 13733 | Frege considered definite descriptions to be genuine singular terms [Frege, by Fitting/Mendelsohn] |
| Full Idea: Frege (1893) considered a definite description to be a genuine singular term (as we do), so that a sentence like 'The present King of France is bald' would have the same logical form as 'Harry Truman is bald'. | |
| From: report of Gottlob Frege (Grundgesetze der Arithmetik 1 (Basic Laws) [1893]) by M Fitting/R Mendelsohn - First-Order Modal Logic | |
| A reaction: The difficulty is what the term refers to, and they embrace a degree of Meinongianism - that is that non-existent objects can still have properties attributed to them, and so can be allowed some sort of 'existence'. |
| 9874 | Contradiction arises from Frege's substitutional account of second-order quantification [Dummett on Frege] |
| Full Idea: The contradiction in Frege's system is due to the presence of second-order quantification, ..and Frege's explanation of the second-order quantifier, unlike that which he provides for the first-order one, appears to be substitutional rather than objectual. | |
| From: comment on Gottlob Frege (Grundgesetze der Arithmetik 1 (Basic Laws) [1893], §25) by Michael Dummett - Frege philosophy of mathematics Ch.17 | |
| A reaction: In Idea 9871 Dummett adds the further point that Frege lacks a clear notion of the domain of quantification. At this stage I don't fully understand this idea, but it is clearly of significance, so I will return to it. |
| 13519 | Model theory uses sets to show that mathematical deduction fits mathematical truth [Wolf,RS] |
| Full Idea: Model theory uses set theory to show that the theorem-proving power of the usual methods of deduction in mathematics corresponds perfectly to what must be true in actual mathematical structures. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], Pref) | |
| A reaction: That more or less says that model theory demonstrates the 'soundness' of mathematics (though normal arithmetic is famously not 'complete'). Of course, he says they 'correspond' to the truths, rather than entailing them. |
| 13533 | First-order model theory rests on completeness, compactness, and the Löwenheim-Skolem-Tarski theorem [Wolf,RS] |
| Full Idea: The three foundations of first-order model theory are the Completeness theorem, the Compactness theorem, and the Löwenheim-Skolem-Tarski theorem. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.3) | |
| A reaction: On p.180 he notes that Compactness and LST make no mention of |- and are purely semantic, where Completeness shows the equivalence of |- and |=. All three fail for second-order logic (p.223). |
| 13531 | Model theory reveals the structures of mathematics [Wolf,RS] |
| Full Idea: Model theory helps one to understand what it takes to specify a mathematical structure uniquely. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.1) | |
| A reaction: Thus it is the development of model theory which has led to the 'structuralist' view of mathematics. |
| 13532 | Model theory 'structures' have a 'universe', some 'relations', some 'functions', and some 'constants' [Wolf,RS] |
| Full Idea: A 'structure' in model theory has a non-empty set, the 'universe', as domain of variables, a subset for each 'relation', some 'functions', and 'constants'. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.2) |
| 13537 | An 'isomorphism' is a bijection that preserves all structural components [Wolf,RS] |
| Full Idea: An 'isomorphism' is a bijection between two sets that preserves all structural components. The interpretations of each constant symbol are mapped across, and functions map the relation and function symbols. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.4) |
| 13539 | The LST Theorem is a serious limitation of first-order logic [Wolf,RS] |
| Full Idea: The Löwenheim-Skolem-Tarski theorem demonstrates a serious limitation of first-order logic, and is one of primary reasons for considering stronger logics. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.7) |
| 13538 | If a theory is complete, only a more powerful language can strengthen it [Wolf,RS] |
| Full Idea: It is valuable to know that a theory is complete, because then we know it cannot be strengthened without passing to a more powerful language. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.5) |
| 13525 | Most deductive logic (unlike ordinary reasoning) is 'monotonic' - we don't retract after new givens [Wolf,RS] |
| Full Idea: Deductive logic, including first-order logic and other types of logic used in mathematics, is 'monotonic'. This means that we never retract a theorem on the basis of new givens. If T|-φ and T⊆SW, then S|-φ. Ordinary reasoning is nonmonotonic. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.7) | |
| A reaction: The classic example of nonmonotonic reasoning is the induction that 'all birds can fly', which is retracted when the bird turns out to be a penguin. He says nonmonotonic logic is a rich field in computer science. |
| 13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
| Full Idea: Less theoretically, an ordinal is an equivalence class of well-orderings. Formally, we say a set is 'transitive' if every member of it is a subset of it, and an ordinal is a transitive set, all of whose members are transitive. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 2.4) | |
| A reaction: He glosses 'transitive' as 'every member of a member of it is a member of it'. So it's membership all the way down. This is the von Neumann rather than the Zermelo approach (which is based on singletons). |
| 18252 | Real numbers are ratios of quantities, such as lengths or masses [Frege] |
| Full Idea: If 'number' is the referent of a numerical symbol, a real number is the same as a ratio of quantities. ...A length can have to another length the same ratio as a mass to another mass. | |
| From: Gottlob Frege (Grundgesetze der Arithmetik 1 (Basic Laws) [1893], III.1.73), quoted by Michael Dummett - Frege philosophy of mathematics 21 'Frege's' | |
| A reaction: This is part of a critique of Cantor and the Cauchy series approach. Interesting that Frege, who is in the platonist camp, is keen to connect the real numbers with natural phenomena. He is always keen to keep touch with the application of mathematics. |
| 18271 | We can't prove everything, but we can spell out the unproved, so that foundations are clear [Frege] |
| Full Idea: It cannot be demanded that everything be proved, because that is impossible; but we can require that all propositions used without proof be expressly declared as such, so that we can see distinctly what the whole structure rests upon. | |
| From: Gottlob Frege (Grundgesetze der Arithmetik 1 (Basic Laws) [1893], p.2), quoted by J. Alberto Coffa - The Semantic Tradition from Kant to Carnap 7 'What' |
| 10623 | Frege defined number in terms of extensions of concepts, but needed Basic Law V to explain extensions [Frege, by Hale/Wright] |
| Full Idea: Frege opts for his famous definition of numbers in terms of extensions of the concept 'equal to the concept F', but he then (in 'Grundgesetze') needs a theory of extensions or classes, which he provided by means of Basic Law V. | |
| From: report of Gottlob Frege (Grundgesetze der Arithmetik 1 (Basic Laws) [1893]) by B Hale / C Wright - Intro to 'The Reason's Proper Study' §1 |
| 9975 | Frege ignored Cantor's warning that a cardinal set is not just a concept-extension [Tait on Frege] |
| Full Idea: Cantor pointed out explicitly to Frege that it is a mistake to take the notion of a set (i.e. of that which has a cardinal number) to simply mean the extension of a concept. ...Frege's later assumption of this was an act of recklessness. | |
| From: comment on Gottlob Frege (Grundgesetze der Arithmetik 1 (Basic Laws) [1893]) by William W. Tait - Frege versus Cantor and Dedekind III | |
| A reaction: ['recklessness' is on p.61] Tait has no sympathy with the image of Frege as an intellectual martyr. Frege had insufficient respect for a great genius. Cantor, crucially, understood infinity much better than Frege. |
| 13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
| Full Idea: One of the great achievements of modern mathematics has been the unification of its many types of objects. It began with showing geometric objects numerically or algebraically, and culminated with set theory representing all the normal objects. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], Pref) | |
| A reaction: His use of the word 'object' begs all sorts of questions, if you are arriving from the street, where an object is something which can cause a bruise - but get used to it, because the word 'object' has been borrowed for new uses. |
| 18165 | My Basic Law V is a law of pure logic [Frege] |
| Full Idea: I hold that my Basic Law V is a law of pure logic. | |
| From: Gottlob Frege (Grundgesetze der Arithmetik 1 (Basic Laws) [1893], p.4), quoted by Penelope Maddy - Naturalism in Mathematics I.1 | |
| A reaction: This is, of course, the notorious law which fell foul of Russell's Paradox. It is said to be pure logic, even though it refers to things that are F and things that are G. |
| 9190 | A concept is a function mapping objects onto truth-values, if they fall under the concept [Frege, by Dummett] |
| Full Idea: In later Frege, a concept could be taken as a particular case of a function, mapping every object on to one of the truth-values (T or F), according as to whether, as we should ordinarily say, that object fell under the concept or not. | |
| From: report of Gottlob Frege (Grundgesetze der Arithmetik 1 (Basic Laws) [1893]) by Michael Dummett - The Philosophy of Mathematics 3.5 | |
| A reaction: As so often in these attempts at explanation, this sounds circular. You can't decide whether an object truly falls under a concept, if you haven't already got the concept. His troubles all arise (I say) because he scorns abstractionist accounts. |
| 13665 | Frege took the study of concepts to be part of logic [Frege, by Shapiro] |
| Full Idea: Frege took the study of concepts and their extensions to be within logic. | |
| From: report of Gottlob Frege (Grundgesetze der Arithmetik 1 (Basic Laws) [1893]) by Stewart Shapiro - Foundations without Foundationalism 7.1 | |
| A reaction: This is part of the plan to make logic a universal language (see Idea 13664). I disagree with this, and with the general logicist view of the position of logic. The logical approach thins concepts out. See Deleuze/Guattari's horror at this. |
| 5049 | Intelligent pleasure is the perception of beauty, order and perfection [Leibniz] |
| Full Idea: An intelligent being's pleasure is simply the perception of beauty, order and perfection. | |
| From: Gottfried Leibniz (A Résumé of Metaphysics [1697], §18) | |
| A reaction: Leibniz seems to have inherited this from the Greeks, especially Pythagoras and Plato. Buried in Leibniz's remark I see the Christian fear of physical pleasure. He should have got out more. Must an intelligent being always be intelligent? |
| 5048 | Perfection is simply quantity of reality [Leibniz] |
| Full Idea: Perfection is simply quantity of reality. | |
| From: Gottfried Leibniz (A Résumé of Metaphysics [1697], §11) | |
| A reaction: An interesting claim, but totally beyond my personal comprehension. I presume he inherited 'quantity of reality' from Plato, e.g. as you move up the Line from shadows to Forms you increase the degree of reality. I see 'real' as all-or-nothing. |
| 5050 | Evil serves a greater good, and pain is necessary for higher pleasure [Leibniz] |
| Full Idea: Evils themselves serve a greater good, and the fact that pains are found in minds is necessary if they are to reach greater pleasures. | |
| From: Gottfried Leibniz (A Résumé of Metaphysics [1697], §23) | |
| A reaction: How much pain is needed to qualify for the 'greater pleasures'? Some people receive an awful lot. I am not sure exactly how an evil can 'serve' a greater good. Is he recommending evil? |