34 ideas
| 18487 | We want to know what makes sentences true, rather than defining 'true' [McFetridge] |
| Full Idea: The generalisation 'What makes a (any) sentence true?' is not a request for definitions of 'true' (the concept), but rather requests for (partial) explanations of why certain particular sentences are true. | |
| From: Ian McFetridge (Truth, Correspondence, Explanation and Knowledge [1977], II) | |
| A reaction: McFetridge is responding to the shortcomings of Tarski's account of truth. The mystery seems to be why some of our representations of the world are 'successful', and others are not. |
| 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. |
| 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) |
| 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. |
| 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'. |
| 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. |
| 18488 | We normally explain natural events by citing further facts [McFetridge] |
| Full Idea: If one were asked 'What makes salt soluble in water?', the most natural answer would be something of the style 'The fact that it has such-and-such structure'. | |
| From: Ian McFetridge (Truth, Correspondence, Explanation and Knowledge [1977], II) | |
| A reaction: Personally I would want to talk about its 'powers' (dispositional properties), rather than its 'structure' (categorical properties). This defends facts, but you could easily paraphrase 'fact' out of this reply (as McFetridge realised). |
| 15083 | The fundamental case of logical necessity is the valid conclusion of an inference [McFetridge, by Hale] |
| Full Idea: McFetridge's conception of logical necessity is one which sees the concept as receiving its fundamental exemplification in the connection between the premiss and conclusion of a deductively valid inference. | |
| From: report of Ian McFetridge (Logical Necessity: Some Issues [1986]) by Bob Hale - Absolute Necessities 2 | |
| A reaction: This would mean that p could be logically necessary but false (if it was a valid argument from false premisses). What if it was a valid inference in a dodgy logical system (including 'tonk', for example)? |
| 15084 | In the McFetridge view, logical necessity means a consequent must be true if the antecedent is [McFetridge, by Hale] |
| Full Idea: McFetridge's view proves that if the conditional corresponding to a valid inference is logically necessary, then there is no sense in which it is possible that its antecedent be true but its consequent false. ..This result generalises to any statement. | |
| From: report of Ian McFetridge (Logical Necessity: Some Issues [1986]) by Bob Hale - Absolute Necessities 2 | |
| A reaction: I am becoming puzzled by Hale's assertion that logical necessity is 'absolute', while resting his case on a conditional. Are we interested in the necessity of the inference, or the necessity of the consequent? |
| 12180 | Logical necessity requires that a valid argument be necessary [McFetridge] |
| Full Idea: There will be a legitimate notion of 'logical' necessity only if there is a notion of necessity which attaches to the claim, concerning a deductively valid argument, that if the premisses are true then so is the conclusion. | |
| From: Ian McFetridge (Logical Necessity: Some Issues [1986], §1) | |
| A reaction: He quotes Aristotle's Idea 11148 in support. Is this resting a stronger idea on a weaker one? Or is it the wrong way round? We endorse validity because we see the necessity; we don't endorse necessity because we see 'validity'. |
| 12184 | Logical necessity overrules all other necessities [McFetridge] |
| Full Idea: If it is logically necessary that if p then q, then there is no other sense of 'necessary' in which it is not necessary that if p then q. | |
| From: Ian McFetridge (Logical Necessity: Some Issues [1986], §1) | |
| A reaction: The thesis which McFetridge proposes to defend. The obvious rival would be metaphysical necessity, and the rival claim would presumably be that things are only logically necessary if that is entailed by a metaphysical necessity. Metaphysics drives logic. |
| 12181 | Traditionally, logical necessity is the strongest, and entails any other necessities [McFetridge] |
| Full Idea: The traditional crucial assumption is that logical necessity is the strongest notion of necessity. If it is logically necessary that p, then it is necessary that p in any other use of the notion of necessity there may be (physically, practically etc.). | |
| From: Ian McFetridge (Logical Necessity: Some Issues [1986], §1) | |
| A reaction: Sounds right. We might say it is physically necessary simply because it is logically necessary, and even that it is metaphysically necessary because it is logically necessary (required by logic). Logical possibility is hence the weakest kind? |
| 12183 | It is only logical necessity if there is absolutely no sense in which it could be false [McFetridge] |
| Full Idea: Is there any sense in which, despite an ascription of necessity to p, it is held that not-p is possible? If there is, then the original claim then it was necessary is not a claim of 'logical' necessity (which is the strongest necessity). | |
| From: Ian McFetridge (Logical Necessity: Some Issues [1986], §1) | |
| A reaction: See Idea 12181, which leads up to this proposed "test" for logical necessity. McFetridge has already put epistemic ('for all I know') possibility to one side. □p→¬◊¬p is the standard reading of necessity. His word 'sense' bears the burden. |
| 12192 | The mark of logical necessity is deduction from any suppositions whatever [McFetridge] |
| Full Idea: The manifestation of the belief that a mode of inference is logically necessarily truth-preserving is the preparedness to employ that mode of inference in reasoning from any set of suppositions whatsoever. | |
| From: Ian McFetridge (Logical Necessity: Some Issues [1986], §4) | |
| A reaction: He rests this on the idea of 'cotenability' of the two sides of a counterfactual (in Mill, Goodman and Lewis). There seems, at first blush, to be a problem of the relevance of the presuppositions. |
| 12182 | We assert epistemic possibility without commitment to logical possibility [McFetridge] |
| Full Idea: Time- and person-relative epistemic possibility can be asserted even when logical possibility cannot, such as undecided mathematical propositions. 'It may be that p' just comes to 'For all I know, not-p'. | |
| From: Ian McFetridge (Logical Necessity: Some Issues [1986], §1) | |
| A reaction: If it is possible 'for all I know', then it could be actual for all I know, and if we accept that it might be actual, we could hardly deny that it is logically possible. Logical and epistemic possibilities of mathematical p stand or fall together. |
| 12187 | Objectual modal realists believe in possible worlds; non-objectual ones rest it on the actual world [McFetridge] |
| Full Idea: The 'objectual modal realist' holds that what makes modal beliefs true are certain modal objects, typically 'possible worlds'. ..The 'non-objectual modal realist' says modal judgements are made true by how things stand with respect to this world. | |
| From: Ian McFetridge (Logical Necessity: Some Issues [1986], §2) | |
| A reaction: I am an enthusiastic 'non-objectual modal realist'. I accept the argument that real possible worlds have no relevance to the actual world, and explain nothing (see Jubien). The possibilities reside in the 'powers' of this world. See Molnar on powers. |
| 12186 | Modal realists hold that necessities and possibilities are part of the totality of facts [McFetridge] |
| Full Idea: The 'modal realist' holds that part of the totality of what is the case, the totality of facts, are such things as that certain events could have happened, certain propositions are necessarily true, if this happened then that would have been the case. | |
| From: Ian McFetridge (Logical Necessity: Some Issues [1986], §2) | |
| A reaction: I am an enthusiastic modal realist. If the aim of philosophy is 'to understand' (and I take that to be the master idea of the subject) then no understanding is possible which excludes the possibilities and necessities in things. |
| 3061 | Anaxarchus said that he was not even sure that he knew nothing [Anaxarchus, by Diog. Laertius] |
| Full Idea: Anaxarchus said that he was not even sure that he knew nothing. | |
| From: report of Anaxarchus (fragments/reports [c.340 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 09.10.1 |
| 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) |
| 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. |
| 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) |
| 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) |