display all the ideas for this combination of philosophers
7 ideas
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. |