Combining Philosophers

All the ideas for W Wimsatt/W Beardsley, Mark Colyvan and Paul Thagard

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


40 ideas

2. Reason / A. Nature of Reason / 6. Coherence
Coherence problems have positive and negative restraints; solutions maximise constraint satisfaction [Thagard]
     Full Idea: A coherence problem is a set of elements connected by positive and negative restraints, and a solution consists of partitioning the elements into two sets (accepted and rejected) in a way that maximises satisfaction of the constraints.
     From: Paul Thagard (Coherence: The Price is Right [2012], p.42)
     A reaction: I'm enthusiastic about this, as it begins to clarify the central activity of epistemology, which is the quest for best explanations.
Coherence is explanatory, deductive, conceptual, analogical, perceptual, and deliberative [Thagard]
     Full Idea: I propose that there are six main kinds of coherence: explanatory, deductive, conceptual, analogical, perceptual, and deliberative. ...Epistemic coherence is a combination of the first five kinds, and ethics adds the sixth.
     From: Paul Thagard (Coherence: The Price is Right [2012], p.43)
     A reaction: Wonderful. Someone is getting to grips with the concept of coherence, instead of just whingeing about how vague it is.
Explanatory coherence needs symmetry,explanation,analogy,data priority, contradiction,competition,acceptance [Thagard]
     Full Idea: Informally, a theory of explanatory coherence has the principles of symmetry, explanation, analogy, data priority, contradiction, competition and acceptance.
     From: Paul Thagard (Coherence: The Price is Right [2012], p.44)
     A reaction: [Thagard give a concise summary of his theory here] Again Thagard makes a wonderful contribution in an area where most thinkers are pessimistic about making any progress. His principles are very plausible.
3. Truth / A. Truth Problems / 6. Verisimilitude
Verisimilitude comes from including more phenomena, and revealing what underlies [Thagard]
     Full Idea: A scientific theory is progressively approximating the truth if it increases its explanatory coherence by broadening to more phenomena and deepening by investigating layers of mechanisms.
     From: Paul Thagard (Coherence: The Price is Right [2012], p.46)
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 / 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 / B. Scientific Theories / 1. Scientific Theory
Neither a priori rationalism nor sense data empiricism account for scientific knowledge [Thagard]
     Full Idea: Both rationalists (who start with a priori truths and make deductions) and empiricists (starting with indubitable sense data and what follows) would guarantee truth, but neither even begins to account for scientific knowledge.
     From: Paul Thagard (Coherence: The Price is Right [2012], p.46)
     A reaction: Thagard's answer, and mine, is inference to the best explanation, but goes beyond both the a priori truths and the perceptions.
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]
Bayesian inference is forced to rely on approximations [Thagard]
     Full Idea: It is well known that the general problem with Bayesian inference is that it is computationally intractable, so the algorithms used for computing posterior probabilities have to be approximations.
     From: Paul Thagard (Coherence: The Price is Right [2012], p.45)
     A reaction: Thagard makes this sound devastating, but then concedes that all theories have to rely on approximations, so I haven't quite grasped this idea. He gives references.
14. Science / D. Explanation / 2. Types of Explanation / c. Explanations by coherence
1: Coherence is a symmetrical relation between two propositions [Thagard, by Smart]
     Full Idea: 1: Coherence and incoherence are symmetrical between pairs of propositions.
     From: report of Paul Thagard (Explanatory Coherence [1989], 1) by J.J.C. Smart - Explanation - Opening Address p.04
2: An explanation must wholly cohere internally, and with the new fact [Thagard, by Smart]
     Full Idea: 2: If a set of propositions explains a further proposition, then each proposition in the set coheres with that proposition, and propositions in the set cohere pairwise with one another.
     From: report of Paul Thagard (Explanatory Coherence [1989], 2) by J.J.C. Smart - Explanation - Opening Address p.04
3: If an analogous pair explain another analogous pair, then they all cohere [Thagard, by Smart]
     Full Idea: 3: If two analogous propositions separately explain different ones of a further pair of analogous propositions, then the first pair cohere with one another, and so do the second (explananda) pair.
     From: report of Paul Thagard (Explanatory Coherence [1989], 3) by J.J.C. Smart - Explanation - Opening Address p.04
4: For coherence, observation reports have a degree of intrinsic acceptability [Thagard, by Smart]
     Full Idea: 4: Observation reports (for coherence) have a degree of acceptability on their own.
     From: report of Paul Thagard (Explanatory Coherence [1989], 4) by J.J.C. Smart - Explanation - Opening Address p.04
     A reaction: Thagard makes this an axiom, but Smart rejects that and says there is no reason why observation reports should not also be accepted because of their coherence (with our views about our senses etc.). I agree with Smart.
5: Contradictory propositions incohere [Thagard, by Smart]
     Full Idea: 5: Contradictory propositions incohere.
     From: report of Paul Thagard (Explanatory Coherence [1989], 5) by J.J.C. Smart - Explanation - Opening Address p.04
     A reaction: This has to be a minimal axiom for coherence, but coherence is always taken to be more than mere logical consistency. Mutual relevance is the first step. At least there must be no category mistakes.
6: A proposition's acceptability depends on its coherence with a system [Thagard, by Smart]
     Full Idea: 6: Acceptability of a proposition in a system depends on its coherence with the propositions in that system.
     From: report of Paul Thagard (Explanatory Coherence [1989], 6) by J.J.C. Smart - Explanation - Opening Address p.04
     A reaction: Thagard tried to build an AI system for coherent explanations, but I would say he has no chance with these six axioms, because they never grasp the nettle of what 'coherence' means. You first need rules for how things relate. What things are comparable?
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.
14. Science / D. Explanation / 3. Best Explanation / a. Best explanation
The best theory has the highest subjective (Bayesian) probability? [Thagard]
     Full Idea: On the Bayesian view, the best theory is the one with the highest subjective probability, given the evidence as calculated by Bayes's theorem.
     From: Paul Thagard (Coherence: The Price is Right [2012], p.45)
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)
21. Aesthetics / C. Artistic Issues / 1. Artistic Intentions
Intentions either succeed or fail, so external evidence for them is always irrelevant [Wimsatt/Beardsley, by Davies,S]
     Full Idea: Wimsatt and Beardsley claimed that either the intention succeeded, so one does not need to look outside the work for its meaning, or the intention failed, so external evidence does not help.
     From: report of W Wimsatt/W Beardsley (The Intentional Fallacy [1946]) by Stephen Davies - The Philosophy of Art (2nd ed) 5.3
     A reaction: Actually, the external evidence may tell you much more clearly and accurately what the intention was than the work itself does. The best example may be the title of the work, which is presumably outside the work.
The author's intentions are irrelevant to the judgement of a work's success [Wimsatt/Beardsley]
     Full Idea: The design or intention of the author is neither available nor desirable as a standard for judging the success of a work of literary art.
     From: W Wimsatt/W Beardsley (The Intentional Fallacy [1946], §I)
     A reaction: This famous proposal may have been misunderstood. Note that it is a comment about judging the work, not about understanding it. The idea allows for a work being much more successful than the author's humble intentions (e.g. Pepys).
Poetry, unlike messages, can be successful without communicating intentions [Wimsatt/Beardsley]
     Full Idea: Poetry differs from practical messages, which are successful if and only if we correctly infer the intention.
     From: W Wimsatt/W Beardsley (The Intentional Fallacy [1946], §I)
     A reaction: I am not convinced by this claim. It is plausible that a work does much more than it intends (Astaire said he danced "to make a buck"), but it is rather odd to rate very highly a work of which you have missed the point.
The thoughts of a poem should be imputed to the dramatic speaker, and hardly at all to the poet [Wimsatt/Beardsley]
     Full Idea: We ought to impute the thoughts and attitudes of the poem immediately to the dramatic speaker, and if to the author at all, only by an act of biographical inference.
     From: W Wimsatt/W Beardsley (The Intentional Fallacy [1946], §I)
     A reaction: Wrong. If in Browning's "My Last Duchess" (say), we only inferred the mind of the speaker (and his Duchess), and took no interest in Browning's view of things, we would miss the point. We might end up respecting the Duke, which would be daft.
The intentional fallacy is a romantic one [Wimsatt/Beardsley]
     Full Idea: The intentional fallacy is a romantic one.
     From: W Wimsatt/W Beardsley (The Intentional Fallacy [1946], §II)
     A reaction: Wrong. Even with those most famous of anonymous artists, the architects and carvers of medieval cathedrals, without some discernment of the purpose you won't get it. The Taj Mahal is a love letter, not a potential ice cream parlour.
Biography can reveal meanings and dramatic character, as well as possible intentions [Wimsatt/Beardsley]
     Full Idea: The use of biographical evidence need not involve intentionalism, because while it may be evidence of what the author intended, it may also be evidence of the meaning of his words and the dramatic character of his utterance.
     From: W Wimsatt/W Beardsley (The Intentional Fallacy [1946], §IV)
     A reaction: I am very keen to penetrate the author's intentions, but I have always be doubtful about the use of biography as a means to achieve this. Most of the effort to infer intentions must come from a study of the work itself, not introductions, letters etc.