36 ideas
| 23367 | Even pointing a finger should only be done for a reason [Epictetus] |
| Full Idea: Philosophy says it is not right even to stretch out a finger without some reason. | |
| From: Epictetus (fragments/reports [c.57], 15) | |
| A reaction: The key point here is that philosophy concerns action, an idea on which Epictetus is very keen. He rather despise theory. This idea perfectly sums up the concept of the wholly rational life (which no rational person would actually want to live!). |
| 8472 | Sentential logic is consistent (no contradictions) and complete (entirely provable) [Orenstein] |
| Full Idea: Sentential logic has been proved consistent and complete; its consistency means that no contradictions can be derived, and its completeness assures us that every one of the logical truths can be proved. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: The situation for quantificational logic is not quite so clear (Orenstein p.98). I do not presume that being consistent and complete makes it necessarily better as a tool in the real world. |
| 8476 | Axiomatization simply picks from among the true sentences a few to play a special role [Orenstein] |
| Full Idea: In axiomatizing, we are merely sorting out among the truths of a science those which will play a special role, namely, serve as axioms from which we derive the others. The sentences are already true in a non-conventional or ordinary sense. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: If you were starting from scratch, as Euclidean geometers may have felt they were doing, you might want to decide which are the simplest truths. Axiomatizing an established system is a more advanced activity. |
| 8480 | S4: 'poss that poss that p' implies 'poss that p'; S5: 'poss that nec that p' implies 'nec that p' [Orenstein] |
| Full Idea: The five systems of propositional modal logic contain successively stronger conceptions of necessity. In S4 'it is poss that it is poss that p' implies 'it is poss that p'. In S5, 'it is poss that it is nec that p' implies 'it is nec that p'. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.7) | |
| A reaction: C.I. Lewis originated this stuff. Any serious student of modality is probably going to have to pick a system. E.g. Nathan Salmon says that the correct modal logic is even weaker than S4. |
| 17926 | Rejecting double negation elimination undermines reductio proofs [Colyvan] |
| Full Idea: The intuitionist rejection of double negation elimination undermines the important reductio ad absurdum proof in classical mathematics. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.3) |
| 17925 | Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan] |
| Full Idea: In intuitionist logic double negation elimination fails. After all, proving that there is no proof that there can't be a proof of S is not the same thing as having a proof of S. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.3) | |
| A reaction: I do like people like Colyvan who explain things clearly. All of this difficult stuff is understandable, if only someone makes the effort to explain it properly. |
| 8474 | Unlike elementary logic, set theory is not complete [Orenstein] |
| Full Idea: The incompleteness of set theory contrasts sharply with the completeness of elementary logic. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: This seems to be Quine's reason for abandoning the Frege-Russell logicist programme (quite apart from the problems raised by Gödel. |
| 8465 | Mereology has been exploited by some nominalists to achieve the effects of set theory [Orenstein] |
| Full Idea: The theory of mereology has had a history of being exploited by nominalists to achieve some of the effects of set theory. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.3) | |
| A reaction: Some writers refer to mereology as a 'theory', and others as an area of study. This appears to be an interesting line of investigation. Orenstein says Quine and Goodman showed its limitations. |
| 17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
| Full Idea: The law of excluded middle (for every proposition P, either P or not-P) must be carefully distinguished from its semantic counterpart bivalence, that every proposition is either true or false. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.3) | |
| A reaction: So excluded middle makes no reference to the actual truth or falsity of P. It merely says P excludes not-P, and vice versa. |
| 8452 | Traditionally, universal sentences had existential import, but were later treated as conditional claims [Orenstein] |
| Full Idea: In traditional logic from Aristotle to Kant, universal sentences have existential import, but Brentano and Boole construed them as universal conditionals (such as 'for anything, if it is a man, then it is mortal'). | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.2) | |
| A reaction: I am sympathetic to the idea that even the 'existential' quantifier should be treated as conditional, or fictional. Modern Christians may well routinely quantify over angels, without actually being committed to them. |
| 8475 | The substitution view of quantification says a sentence is true when there is a substitution instance [Orenstein] |
| Full Idea: The substitution view of quantification explains 'there-is-an-x-such-that x is a man' as true when it has a true substitution instance, as in the case of 'Socrates is a man', so the quantifier can be read as 'it is sometimes true that'. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: The word 'true' crops up twice here. The alternative (existential-referential) view cites objects, so the substitution view is a more linguistic approach. |
| 17929 | Löwenheim proved his result for a first-order sentence, and Skolem generalised it [Colyvan] |
| Full Idea: Löwenheim proved that if a first-order sentence has a model at all, it has a countable model. ...Skolem generalised this result to systems of first-order sentences. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 2.1.2) |
| 17930 | Axioms are 'categorical' if all of their models are isomorphic [Colyvan] |
| Full Idea: A set of axioms is said to be 'categorical' if all models of the axioms in question are isomorphic. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 2.1.2) | |
| A reaction: The best example is the Peano Axioms, which are 'true up to isomorphism'. Set theory axioms are only 'quasi-isomorphic'. |
| 8454 | The whole numbers are 'natural'; 'rational' numbers include fractions; the 'reals' include root-2 etc. [Orenstein] |
| Full Idea: The 'natural' numbers are the whole numbers 1, 2, 3 and so on. The 'rational' numbers consist of the natural numbers plus the fractions. The 'real' numbers include the others, plus numbers such a pi and root-2, which cannot be expressed as fractions. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.2) | |
| A reaction: The 'irrational' numbers involved entities such as root-minus-1. Philosophical discussions in ontology tend to focus on the existence of the real numbers. |
| 17928 | Ordinal numbers represent order relations [Colyvan] |
| Full Idea: Ordinal numbers represent order relations. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.2.3 n17) |
| 17923 | Intuitionists only accept a few safe infinities [Colyvan] |
| Full Idea: For intuitionists, all but the smallest, most well-behaved infinities are rejected. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.3) | |
| A reaction: The intuitionist idea is to only accept what can be clearly constructed or proved. |
| 17941 | Infinitesimals were sometimes zero, and sometimes close to zero [Colyvan] |
| Full Idea: The problem with infinitesimals is that in some places they behaved like real numbers close to zero but in other places they behaved like zero. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 7.1.2) | |
| A reaction: Colyvan gives an example, of differentiating a polynomial. |
| 17922 | Reducing real numbers to rationals suggested arithmetic as the foundation of maths [Colyvan] |
| Full Idea: Given Dedekind's reduction of real numbers to sequences of rational numbers, and other known reductions in mathematics, it was tempting to see basic arithmetic as the foundation of mathematics. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.1) | |
| A reaction: The reduction is the famous Dedekind 'cut'. Nowadays theorists seem to be more abstract (Category Theory, for example) instead of reductionist. |
| 17936 | Transfinite induction moves from all cases, up to the limit ordinal [Colyvan] |
| Full Idea: Transfinite inductions are inductive proofs that include an extra step to show that if the statement holds for all cases less than some limit ordinal, the statement also holds for the limit ordinal. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.1 n11) |
| 17940 | Most mathematical proofs are using set theory, but without saying so [Colyvan] |
| Full Idea: Most mathematical proofs, outside of set theory, do not explicitly state the set theory being employed. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 7.1.1) |
| 17931 | Structuralism say only 'up to isomorphism' matters because that is all there is to it [Colyvan] |
| Full Idea: Structuralism is able to explain why mathematicians are typically only interested in describing the objects they study up to isomorphism - for that is all there is to describe. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 3.1.2) |
| 17932 | If 'in re' structures relies on the world, does the world contain rich enough structures? [Colyvan] |
| Full Idea: In re structuralism does not posit anything other than the kinds of structures that are in fact found in the world. ...The problem is that the world may not provide rich enough structures for the mathematics. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 3.1.2) | |
| A reaction: You can perceive a repeating pattern in the world, without any interest in how far the repetitions extend. |
| 8473 | The logicists held that is-a-member-of is a logical constant, making set theory part of logic [Orenstein] |
| Full Idea: The question to be posed is whether is-a-member-of should be considered a logical constant, that is, does logic include set theory. Frege, Russell and Whitehead held that it did. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: This is obviously the key element in the logicist programme. The objection seems to be that while first-order logic is consistent and complete, set theory is not at all like that, and so is part of a different world. |
| 8458 | Just individuals in Nominalism; add sets for Extensionalism; add properties, concepts etc for Intensionalism [Orenstein] |
| Full Idea: Modest ontologies are Nominalism (Goodman), admitting only concrete individuals; and Extensionalism (Quine/Davidson) which admits individuals and sets; but Intensionalists (Frege/Carnap/Church/Marcus/Kripke) may have propositions, properties, concepts. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.3) | |
| A reaction: I don't like sets, because of Idea 7035. Even the ontology of individuals could collapse dramatically (see the ideas of Merricks, e.g. 6124). The intensional items may be real enough, but needn't have a place at the ontological high table. |
| 8457 | The Principle of Conservatism says we should violate the minimum number of background beliefs [Orenstein] |
| Full Idea: The principle of conservatism in choosing between theories is a maxim of minimal mutilation, stating that of competing theories, all other things being equal, choose the one that violates the fewest background beliefs held. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.2) | |
| A reaction: In this sense, all rational people should be conservatives. The idea is a modern variant of Hume's objection to miracles (Idea 2227). A Kuhnian 'paradigm shift' is the dramatic moment when this principle no longer seems appropriate. |
| 17943 | Probability supports Bayesianism better as degrees of belief than as ratios of frequencies [Colyvan] |
| Full Idea: Those who see probabilities as ratios of frequencies can't use Bayes's Theorem if there is no objective prior probability. Those who accept prior probabilities tend to opt for a subjectivist account, where probabilities are degrees of belief. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 9.1.8) | |
| A reaction: [compressed] |
| 17939 | Mathematics can reveal structural similarities in diverse systems [Colyvan] |
| Full Idea: Mathematics can demonstrate structural similarities between systems (e.g. missing population periods and the gaps in the rings of Saturn). | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 6.3.2) | |
| A reaction: [Colyvan expounds the details of his two examples] It is these sorts of results that get people enthusiastic about the mathematics embedded in nature. A misunderstanding, I think. |
| 17938 | Mathematics can show why some surprising events have to occur [Colyvan] |
| Full Idea: Mathematics can show that under a broad range of conditions, something initially surprising must occur (e.g. the hexagonal structure of honeycomb). | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 6.3.2) |
| 17934 | Proof by cases (by 'exhaustion') is said to be unexplanatory [Colyvan] |
| Full Idea: Another style of proof often cited as unexplanatory are brute-force methods such as proof by cases (or proof by exhaustion). | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.1) |
| 17933 | Reductio proofs do not seem to be very explanatory [Colyvan] |
| Full Idea: One kind of proof that is thought to be unexplanatory is the 'reductio' proof. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.1) | |
| A reaction: Presumably you generate a contradiction, but are given no indication of why the contradiction has arisen? Tracking back might reveal the source of the problem? Colyvan thinks reductio can be explanatory. |
| 17935 | If inductive proofs hold because of the structure of natural numbers, they may explain theorems [Colyvan] |
| Full Idea: It might be argued that any proof by induction is revealing the explanation of the theorem, namely, that it holds by virtue of the structure of the natural numbers. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.1) | |
| A reaction: This is because induction characterises the natural numbers, in the Peano Axioms. |
| 17942 | Can a proof that no one understands (of the four-colour theorem) really be a proof? [Colyvan] |
| Full Idea: The proof of the four-colour theorem raises questions about whether a 'proof' that no one understands is a proof. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 9.1.6) | |
| A reaction: The point is that the theorem (that you can colour countries on a map with just four colours) was proved with the help of a computer. |
| 17937 | Mathematical generalisation is by extending a system, or by abstracting away from it [Colyvan] |
| Full Idea: One type of generalisation in mathematics extends a system to go beyond what is was originally set up for; another kind involves abstracting away from some details in order to capture similarities between different systems. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.2) |
| 8477 | People presume meanings exist because they confuse meaning and reference [Orenstein] |
| Full Idea: A good part of the confidence people have that there are meanings rests on the confusion of meaning and reference. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.6) | |
| A reaction: An important point. Everyone assumes that sentences link to the world, but Frege shows that that is not part of meaning. Words like prepositions and conjunctions ('to', 'and') don't have 'a meaning' apart from their function and use. |
| 8471 | Three ways for 'Socrates is human' to be true are nominalist, platonist, or Montague's way [Orenstein] |
| Full Idea: 'Socrates is human' is true if 1) subject referent is identical with a predicate referent (Nominalism), 2) subject reference member of the predicate set, or the subject has that property (Platonism), 3) predicate set a member of the subject set (Montague) | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.3) | |
| A reaction: Orenstein offers these as alternatives to Quine's 'inscrutability of reference' thesis, which makes the sense unanalysable. |
| 8484 | If two people believe the same proposition, this implies the existence of propositions [Orenstein] |
| Full Idea: If we can say 'there exists a p such that John believes p and Barbara believes p', logical forms such as this are cited as evidence for our ontological commitment to propositions. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.7) | |
| A reaction: Opponents of propositions (such as Quine) will, of course, attempt to revise the logical form to eliminate the quantification over propositions. See Orenstein's outline on p.171. |