29 ideas
| 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. |
| 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'. |
| 21554 | Sets always exceed terms, so all the sets must exceed all the sets [Lackey] |
| Full Idea: Cantor proved that the number of sets in a collection of terms is larger than the number of terms. Hence Cantor's Paradox says the number of sets in the collection of all sets must be larger than the number of sets in the collection of all sets. | |
| From: Douglas Lackey (Intros to Russell's 'Essays in Analysis' [1973], p.127) | |
| A reaction: The sets must count as terms in the next iteration, but that is a normal application of the Power Set axiom. |
| 21553 | It seems that the ordinal number of all the ordinals must be bigger than itself [Lackey] |
| Full Idea: The ordinal series is well-ordered and thus has an ordinal number, and a series of ordinals to a given ordinal exceeds that ordinal by 1. So the series of all ordinals has an ordinal number that exceeds its own ordinal number by 1. | |
| From: Douglas Lackey (Intros to Russell's 'Essays in Analysis' [1973], p.127) | |
| A reaction: Formulated by Burali-Forti in 1897. |
| 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. |
| 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) |
| 8329 | Either causal relations are given in experience, or they are unobserved and theoretical [Sosa/Tooley] |
| Full Idea: There is a fundamental choice between the realist approach to causation which says that the relation is immediately given in experience, and the view that causation is a theoretical relation, and so not directly observable. | |
| From: E Sosa / M Tooley (Introduction to 'Causation' [1993], §1) | |
| A reaction: Even if immediate experience is involved, there is a step of abstraction in calling it a cause, and picking out events. A 'theoretical relation' is not of much interest there if no observations are involved. I don't think a choice is required here. |
| 8324 | The problem is to explain how causal laws and relations connect, and how they link to the world [Sosa/Tooley] |
| Full Idea: Causal states of affairs encompass causal laws, and causal relations between events or states of affairs; two key questions concern the relation between causal laws and causal relations, and the relation between these and non-causal affairs. | |
| From: E Sosa / M Tooley (Introduction to 'Causation' [1993], §1) | |
| A reaction: This is the agenda for modern analytical philosophy. I'm not quite clear what would count as an answer. When have you 'explained' a relation? Does calling it 'gravity', or finding an equation, explain that relation? Do gravitinos explain it? |
| 8328 | Causation isn't energy transfer, because an electron is caused by previous temporal parts [Sosa/Tooley] |
| Full Idea: The temporal parts of an electron (for example) are causally related, but this relation does not involve any transfer of energy or momentum. Causation cannot be identified with physical energy relations, and physicalist reductions look unpromising. | |
| From: E Sosa / M Tooley (Introduction to 'Causation' [1993], §1) | |
| A reaction: This idea, plus Idea 8327, are their grounds for rejecting Fair's proposal (Idea 8326). It feels like a different use of 'cause' when we say 'the existence of x was caused by its existence yesterday'. It is more like inertia. Destruction needs energy. |
| 8327 | If direction of causation is just direction of energy transfer, that seems to involve causation [Sosa/Tooley] |
| Full Idea: The objection to Fair's view that the direction of causation is the direction of the transference of energy and/or momentum is that the concept of transference itself involves the idea of causation. | |
| From: E Sosa / M Tooley (Introduction to 'Causation' [1993], §1) | |
| A reaction: Does it? If a particle proceeds from a to b, how is that causation? ...But the problem is that the particle kicks open the door when it arrives (i.e. makes changes). We wouldn't call it causation if the transference didn't change any properties. |
| 8330 | Are causes sufficient for the event, or necessary, or both? [Sosa/Tooley] |
| Full Idea: An early view of causation (Mill and Hume) is whatever is (ceteris paribus) sufficient for the event. A second view (E.Nagel) is that the cause should just be necessary. Some (R.Taylor) even contemplate the cause having to be necessary and sufficient. | |
| From: E Sosa / M Tooley (Introduction to 'Causation' [1993], §2) | |
| A reaction: A cause can't be necessary if there is some other way to achieve the effect. A single cause is not sufficient if many other factors are also essential. If neither of those is right, then 'both' is wrong. Enter John Mackie... |
| 8325 | The dominant view is that causal laws are prior; a minority say causes can be explained singly [Sosa/Tooley] |
| Full Idea: The dominant view is that causal laws are more basic than causal relations, with relations being logically supervenient on causal laws, and on properties and event relations; some, though, defend the singularist view, in which events alone can be related. | |
| From: E Sosa / M Tooley (Introduction to 'Causation' [1993], §1) | |
| A reaction: I am deeply suspicious about laws (see Idea 5470). I suspect that the laws are merely descriptions of the regularities that arise from the single instances of causation. We won't explain the single instances, but then laws don't 'explain' them either. |