Combining Philosophers

All the ideas for Hermarchus, Henri Poincar and Mark Colyvan

unexpand these ideas     |    start again     |     specify just one area for these philosophers


28 ideas

4. Formal Logic / E. Nonclassical Logics / 2. Intuitionist Logic
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)
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.
5. Theory of Logic / D. Assumptions for Logic / 2. Excluded Middle
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.
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
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)
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
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'.
6. Mathematics / A. Nature of Mathematics / 2. Geometry
One geometry cannot be more true than another [Poincaré]
     Full Idea: One geometry cannot be more true than another; it can only be more convenient.
     From: Henri Poincaré (Science and Method [1908], p.65), quoted by Stewart Shapiro - Philosophy of Mathematics
     A reaction: This is the culminating view after new geometries were developed by tinkering with Euclid's parallels postulate.
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / e. Ordinal numbers
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)
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / a. The Infinite
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.
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / d. Actual infinite
Poincaré rejected the actual infinite, claiming definitions gave apparent infinity to finite objects [Poincaré, by Lavine]
     Full Idea: Poincaré rejected the actual infinite. He viewed mathematics that is apparently concerned with the actual infinite as actually concerning the finite linguistic definitions the putatively describe actually infinite objects.
     From: report of Henri Poincaré (On the Nature of Mathematical Reasoning [1894]) by Shaughan Lavine - Understanding the Infinite
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / j. Infinite divisibility
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.
6. Mathematics / B. Foundations for Mathematics / 1. Foundations for Mathematics
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.
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
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)
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
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)
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / a. Structuralism
Mathematicians do not study objects, but relations between objects [Poincaré]
     Full Idea: Mathematicians do not study objects, but relations between objects; it is a matter of indifference if the objects are replaced by others, provided the relations do not change. They are interested in form alone, not matter.
     From: Henri Poincaré (Science and Hypothesis [1902], p.20), quoted by E Reck / M Price - Structures and Structuralism in Phil of Maths §6
     A reaction: This connects modern structuralism with Aritotle's interest in the 'form' of things. Contrary to the views of the likes of Frege, it is hard to see that the number '7' has any properties at all, apart from its relations. A daffodil would do just as well.
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)
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / e. Structuralism critique
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.
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / a. Constructivism
Convention, yes! Arbitrary, no! [Poincaré, by Putnam]
     Full Idea: Poincaré once exclaimed, 'Convention, yes! Arbitrary, no!'.
     From: report of Henri Poincaré (talk [1901]) by Hilary Putnam - Models and Reality
     A reaction: An interesting view. It mustn't be assumed that conventions are not rooted in something. Maybe a sort of pragmatism is implied.
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / d. Predicativism
Avoid non-predicative classifications and definitions [Poincaré]
     Full Idea: Never consider any objects but those capable of being defined in a finite number of word ...Avoid non-predicative classifications and definitions.
     From: Henri Poincaré (The Logic of Infinity [1909], p.63), quoted by Penelope Maddy - Naturalism in Mathematics II.4
14. Science / C. Induction / 6. Bayes's Theorem
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]
14. Science / D. Explanation / 2. Types of Explanation / e. Lawlike explanations
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.
14. Science / D. Explanation / 2. Types of Explanation / f. Necessity in explanations
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)
14. Science / D. Explanation / 2. Types of Explanation / m. Explanation by proof
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)
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.
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.
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.
15. Nature of Minds / C. Capacities of Minds / 5. Generalisation by mind
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)
25. Social Practice / F. Life Issues / 6. Animal Rights
Animals are dangerous and nourishing, and can't form contracts of justice [Hermarchus, by Sedley]
     Full Idea: Hermarchus said that animal killing is justified by considerations of human safety and nourishment and by animals' inability to form contractual relations of justice with us.
     From: report of Hermarchus (fragments/reports [c.270 BCE]) by David A. Sedley - Hermarchus
     A reaction: Could the last argument be used to justify torturing animals? Or could we eat a human who was too brain-damaged to form contracts?
26. Natural Theory / D. Laws of Nature / 11. Against Laws of Nature
The aim of science is just to create a comprehensive, elegant language to describe brute facts [Poincaré, by Harré]
     Full Idea: In Poincaré's view, we try to construct a language within which the brute facts of experience are expressed as comprehensively and as elegantly as possible. The job of science is the forging of a language precisely suited to that purpose.
     From: report of Henri Poincaré (The Value of Science [1906], Pt III) by Rom Harré - Laws of Nature 2
     A reaction: I'm often struck by how obscure and difficult our accounts of self-evident facts can be. Chairs are easy, and the metaphysics of chairs is hideous. Why is that? I'm a robust realist, but I like Poincaré's idea. He permits facts.