Combining Philosophers

All the ideas for Hermarchus, Mark Colyvan and Keith Donnellan

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


30 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 / F. Referring in Logic / 2. Descriptions / a. Descriptions
Russell only uses descriptions attributively, and Strawson only referentially [Donnellan, by Lycan]
     Full Idea: Donnellan objects that Russell's theory of definite descriptions overlooks the referential use (Russell writes as if all descriptions are used attributively), and that Strawson assumes they are all used referentially, to draw attention to things.
     From: report of Keith Donnellan (Reference and Definite Descriptions [1966]) by William Lycan - Philosophy of Language Ch.1
     A reaction: This seems like a nice little success for analytical philosophy - clarifying a horrible mess by making a simple distinction that leaves everyone happy.
5. Theory of Logic / F. Referring in Logic / 2. Descriptions / b. Definite descriptions
A definite description can have a non-referential use [Donnellan]
     Full Idea: A definite description may also be used non-referentially, even as it occurs in one and the same sentence.
     From: Keith Donnellan (Reference and Definite Descriptions [1966], §I)
     A reaction: Donnellan says we have to know about the particular occasion on which the description is used, as in itself it will not achieve reference. "Will the last person out switch off the lights" achieves its reference at the end of each day.
Definite descriptions are 'attributive' if they say something about x, and 'referential' if they pick x out [Donnellan]
     Full Idea: A speaker who uses a definite description 'attributively' in an assertion states something about whoever or whatever is the so-and-so; a speaker who uses it 'referentially' enables his audience to pick out whom or what he is talking about.
     From: Keith Donnellan (Reference and Definite Descriptions [1966], §III)
     A reaction: "Smith's murderer is insane" exemplifies the first use before he is caught, and the second use afterwards. The gist is that reference is not a purely linguistic activity, but is closer to pointing at something. This seems right.
'The x is F' only presumes that x exists; it does not actually entail the existence [Donnellan]
     Full Idea: For Russell there is a logical entailment: 'the x is F' entails 'there exists one and only one x'. Whether or not this is true of the attributive use of definite descriptions, it does not seem true of the referential use. The existence is a presumption.
     From: Keith Donnellan (Reference and Definite Descriptions [1966], §VI)
     A reaction: Can we say 'x does not exist, but x is F'? Strictly, that sounds to me more like a contradiction than a surprising rejection of a presumption. However, 'Father Xmas does not exist, but he has a red coat'.
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 / 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 / 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
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.
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)
19. Language / B. Reference / 4. Descriptive Reference / b. Reference by description
A definite description 'the F' is referential if the speaker could thereby be referring to something not-F [Donnellan, by Sainsbury]
     Full Idea: Donnellan argued that we could recognize a referential use of a definite description 'the F' by the fact that the speaker could thereby refer to something which is not F.
     From: report of Keith Donnellan (Reference and Definite Descriptions [1966]) by Mark Sainsbury - The Essence of Reference 18.5
     A reaction: If the expression employed achieved reference whether the speaker wanted it to or not, it would certainly look as if the expression was inherently referring.
Donnellan is unclear whether the referential-attributive distinction is semantic or pragmatic [Bach on Donnellan]
     Full Idea: Donnellan seems to be unsure whether to regard his referential-attributive distinction as indicating a semantic ambiguity or merely a pragmatic one.
     From: comment on Keith Donnellan (Reference and Definite Descriptions [1966]) by Kent Bach - What Does It Take to Refer? 22.2 L1
     A reaction: I vote for pragmatic. In a single brief conversation a definite description could start as attributive and end as referential, but it seems unlikely that its semantics changed in mid-paragraph.
A description can successfully refer, even if its application to the subject is not believed [Donnellan]
     Full Idea: If I think the king is a usurper, "Is the king in his counting house?" succeeds in referring to the right man, even though I do not believe that he fits the description.
     From: Keith Donnellan (Reference and Definite Descriptions [1966], §IV)
     A reaction: This seems undeniable. If I point at someone, I can refer successfully with almost any description. "Oy! Adolf! Get me a drink!" Reference is an essential aspect of language, and it is not entirely linguistic.
19. Language / B. Reference / 5. Speaker's Reference
Whether a definite description is referential or attributive depends on the speaker's intention [Donnellan]
     Full Idea: Whether or not a definite description is used referentially or attributively is a function of the speaker's intentions in a particular case.
     From: Keith Donnellan (Reference and Definite Descriptions [1966], §VII)
     A reaction: Donnellan's distinction, and his claim here, seem to me right. However words on a notice could refer on one occasion, and just describe on another. "Anyone entering this cage is mad".
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?