HEMPEL’S RAVEN PARADOX A lacuna in the standard Bayesian solution Peter B. M. Vranas Iowa State University PSA’02, 8 November 2002.

Slides:



Advertisements
Similar presentations
General Argument from Evil Against the Existence of God The argument that an all-powerful, all- knowing, and perfectly good God would not allow any—or.
Advertisements

PROOF BY CONTRADICTION
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
From Anti-Scepticism to the Contingent A Priori Brian Weatherson Cornell University.
Introduction to Theorem Proving
Confirmation and the ravens paradox 1 Seminar 3: Philosophy of the Sciences Wednesday, 21 September
DO CRY OVER SPILT MILK: POSSIBLY YOU CAN CHANGE THE PAST Peter B. M. Vranas Iowa State University Central APA, 28 April 2005.
Higher / Int.2 Philosophy 5. ” All are lunatics, but he who can analyze his delusion is called a philosopher.” Ambrose Bierce “ Those who lack the courage.
CAN I KILL MY YOUNGER SELF? Time Travel and the Retro-Suicide Paradox Peter B. M. Vranas The University of Michigan 15 September 2000.
Euler’s circles Some A are not B. All B are C. Some A are not C. Algorithm = a method of solution guaranteed to give the right answer.
Evaluating arguments - 1 Logic ~ deductive argument forms zSome common deductive argument forms yArgument forms most often used in everyday argumentation.
Stupid Bayesian Tricks Gregory Lopez, MA, PharmD SkeptiCamp 2009.
Knowledge The Pop Quiz Paradox. Replies to Gettier The Tripartite Analysis: S knows that p iff i. p is true, ii. S believes that p; iii. S’s belief that.
Intro to Logic: the tools of the trade You need to be able to: Recognize an argument when you see one (in media, articles, people’s claims). Organize arguments.
Relativism, Truth, and Reality. Wood combines with phlogiston, of negative weight, when it burns, to leave ash; the ash weighs less that the wood; thus.
Logic 3 Tautological Implications and Tautological Equivalences
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
Essential Deduction Techniques of Constructing Formal Expressions and Evaluating Attempts to Create Valid Arguments.
Logic. what is an argument? People argue all the time ― that is, they have arguments.  It is not often, however, that in the course of having an argument.
True/False. False True Subject May Go Here True / False ? Type correct answer here. Type incorrect answer here.
Proving the implications of the truth functional notions  How to prove claims that are the implications of the truth functional notions  Remember that.
Essential Deduction Techniques of Constructing Formal Expressions Evaluating Attempts to Create Valid Arguments.
Cognitive - reasoning.ppt © 2001 Laura Snodgrass, Ph.D.1 Reasoning and Decision Making Five general strategies Reasoning and Logic Two hypotheses –inherently.
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Logic Leo Cheung. Stuff you need to know Logical equivalence Write logical formula from truth table De Morgan’s Law Contrapositive If and only if Modus.
Infintesimal confirmation. The Raven Paradox 1)A red herring confirms the hypothesis that all non-black things are non-ravens. 2)The hypothesis that all.
Is there any proof that the Bible is true?
Copyright © 2005 Pearson Education, Inc. Slide 1-1.
On Bayesian Measures 27 May 2005 V. Crup i Vincenzo Crupi Department of Cognitive and Education Sciences Laboratory of Cognitive Sciences University of.
Age of the Sage Advertising, Inc. “I cannot teach anybody anything; I can only make him think.” Socrates.
LECTURE 20 THE PRINCIPLE OF SUFFICIENT REASON: CAN IT BE SAVED?
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Logical Arguments. Strength 1.A useless argument is one in which the truth of the premisses has no effect at all on the truth of the conclusion. 2.A weak.
March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.
Deductive versus Inductive Reasoning Consider the following two passages: Argument #1 Mr. Jones is a member of the Academy of Scholarly Fellows and only.
Inductive Reasoning. The Nature of Inductive Reasoning What is an inductive argument? What is an inductive argument? 1. Any argument which is not deductive!
Reasoning.
Chapter 3: MAKING SENSE OF ARGUMENTS
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
An Enquiry into Computer Understanding Peter Cheeseman Computational Intelligence 4 (1) pp58-66 (1988)
Philosophical Method  Logic: A Calculus For Good Reason  Clarification, Not Obfuscation  Distinctions and Disambiguation  Examples and Counterexamples.
LECTURE 19 THE COSMOLOGICAL ARGUMENT CONTINUED. THE QUANTUM MECHANICAL OBJECTION DEPENDS UPON A PARTICULAR INTERPRETATION WE MIGHT REASONABLY SUSPEND.
BHS Methods in Behavioral Sciences I April 9, 2003 Chapter 2 (Stanovich) – Falsifiability: How to Foil Little Green Men in the Head.
The construction of a formal argument
6.6 Argument Forms and Fallacies
Syllogisms and Three Types of Hypothetical Syllogisms
Essential Deduction Techniques of Constructing Formal Expressions Evaluating Attempts to Create Valid Arguments.
Transient Unterdetermination and the Miracle Argument Paul Hoyningen-Huene Leibniz Universität Hannover Center for Philosophy and Ethics of Science (ZEWW)
Certainty and ErrorCertainty and Error One thing Russell seems right about is that we don’t need certainty in order to know something. In fact, even Descartes.
Copyright © Cengage Learning. All rights reserved.
WHO’S AFRAID OF UNDERMINING? Why the Principal Principle need not contradict Humean Supervenience Peter B. M. Vranas The University of Michigan.
The Raven Paradox. 1)DeeDee said she locked the door. 2)If (1), she locked the door. 3)DeeDee locked the door.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
GGHS PHILOSOPHY 101 THE ARGUMENT FROM EVIL. FIRST VERSION (1)If God, were to exist then that being would be all-powerful, all knowing, and all loving.
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
Aquinas III: The Cause of God and the Argument from Contingency.
Induction versus deduction Deductive: P1,..., Pn; therefore Q Inductive: P1,..., Pn; therefore Q is very likely to be true.
Relevance Premises are relevant to the conclusion when the truth of the premises provide some evidence that the conclusion is true Premises are irrelevant.
Infinitesimal Confirmation
If You Aren’t Dong Arguments, You Aren’t Doing Evidence
Confirmation The Raven Paradox.
The Paradox of the 99-foot Man
Introduction to Philosophy Lecture 3a Evaluating an argument
Philosophy and Logic Section 4.3
Probabilistic Reasoning With Bayes’ Rule
Arguments in Sentential Logic
INFORMATIVE ABOUTNESS
Probabilistic Reasoning With Bayes’ Rule
Avoiding Ungrounded Assumptions
Presentation transcript:

HEMPEL’S RAVEN PARADOX A lacuna in the standard Bayesian solution Peter B. M. Vranas Iowa State University PSA’02, 8 November 2002

OVERVIEW PART 1 Hempel’s paradox, the Bayesian solution, and the disputed assumption PART 2 Two attempts to defend the assumption PART 3 Three attempts to refute the assumption CONCLUSION A possible way out for Bayesians

HEMPEL’S PARADOX l Nicod’s Condition: The proposition that an object x has properties F and G confirms the proposition that every F has G. l Equivalence Condition: If the proposition P confirms Q and Q is logically equivalent to Q', then P confirms Q'. ___________________________________________________________________________________________________________________________________________________________ l Paradoxical Conclusion: The proposition (E) that a is a nonblack nonraven confirms the proposition (H) that every raven is black.

THE BAYESIAN SOLUTION & THE DISPUTED ASSUMPTION l H   x(Rx  Bx) (every raven is black). l E  ~Ba~Ra (a is a nonblack nonraven). l P(Ra|~Ba) =  2 (positive but minute)—there are many more nonblack objects than ravens. The disputed assumption: P(Ba|H) = P(Ba). Equivalently: P(~Ba|H) = P(~Ba). Then: P(H|E) - P(H) = P(H)  2 /(1-  2 ), which is both positive and minute.

THE ASSUMPTION IS NEEDED FOR THE BAYESIAN SOLUTION l P(H|E) - P(H) is both positive and minute iff: 0 < P(H|E) - P(H) <  2 (minute). l Equivalently: 1-  2 < P(~Ba|H)/P(~Ba) < (1-  2 )[1+(  2 /P(H))]. l Equivalently: P(~Ba|H)/P(~Ba)  1. l Equivalently: P(~Ba|H)  P(~Ba).

OVERVIEW PART 1 Hempel’s paradox, the Bayesian solution, and the disputed assumption PART 2 Two attempts to defend the assumption PART 3 Three attempts to refute the assumption CONCLUSION A possible way out for Bayesians

FIRST ATTEMPT TO DEFEND THE ASSUMPTION Let P + be my subjective probability measure right after I learn that H is true. l Woodward’s (1985) argument: (1) P + (Ba) = P(Ba) (2) P + (Ba) = P(Ba|H) ______________________________________________________________________ (3) P(Ba) = P(Ba|H) l My reply: One person’s modus ponens is another’s modus tollens. Those who deny (3) will also deny (1).

SECOND ATTEMPT TO DEFEND THE ASSUMPTION l Principle of Conditional Indifference (PCI): If none of H 1, H 2 gives more support than the other to E, then P(E|H 1 ) = P(E|H 2 ). l So P(Ba|H) = P(Ba|~H), which is equivalent to the assumption P(Ba|H) = P(Ba). l My reply: Compare PCI to the Principle of Indifference (PI): If E gives no more support to one of H 1, H 2 than to the other, then P(H 1 |E) = P(H 2 |E). PI leads to inconsis- tencies, and so does PCI.

WEAK & STRONG VERSIONS OF THE ASSUMPTION l Weak: P(Ba|H) and P(Ba) may be equal. Strong: P(Ba|H) and P(Ba) should be equal. l The strong version is needed for the claim that E confirms H; i.e., that P(H|E) should exceed P(H). l But the strong version is hard to defend. Even if one refutes the claim that P(Ba|H) and P(Ba) should differ, all that follows is that they may be equal, namely the weak version.

OVERVIEW PART 1 Hempel’s paradox, the Bayesian solution, and the disputed assumption PART 2 Two attempts to defend the assumption PART 3 Three attempts to refute the assumption CONCLUSION A possible way out for Bayesians

FIRST ATTEMPT TO REFUTE THE ASSUMPTION l Horwich’s (1982) argument: The assumption has the counterintuitive consequence that H is slightly disconfirmed by the proposition that a is a black nonraven. l My reply: To the charge that on their account E confirms H, Bayesians reply that the degree of confirmation is minute. Similarly, to the charge that on their account Ba~Ra disconfirms H, Bayesians can reply that the degree of disconfirmation is minute.

SECOND ATTEMPT TO REFUTE THE ASSUMPTION Let (again) P + be my subjective probability measure right after I learn that H is true. l Swinburne’s (1971) argument: (1') P + (Ba) > P(Ba) (2) P + (Ba) = P(Ba|H) ______________________________________________________________________ (3') P(Ba|H) > P(Ba) l My reply: One person’s modus ponens is another’s modus tollens. Those who deny (3') will also deny (1').

THIRD ATTEMPT TO REFUTE THE ASSUMPTION l Maher’s (1999) argument: (1) P(~Ba|H) = P(~BaRa|H) +P(~Ba~Ra|H) (2) P(~Ba|~H) = P(~BaRa|~H)+P(~Ba~Ra|~H) _________________________________________________________________________________________________________________________________________________________ (3) P(~Ba|H) < P(~Ba|~H); equivalently, P(~Ba|H) < P(~Ba), so the assumption fails. l My reply: How does (3) follow, unless P(~Ba~Ra|H) = P(~Ba~Ra|~H)? But this is equivalent to P(H|~Ba~Ra) = P(H) and thus begs the question against Bayesians.

OVERVIEW PART 1 Hempel’s paradox, the Bayesian solution, and the disputed assumption PART 2 Two attempts to defend the assumption PART 3 Three attempts to refute the assumption CONCLUSION A possible way out for Bayesians

CONCLUSION: A POSSIBLE WAY OUT FOR BAYESIANS l Prescriptive question: Does E confirm H? The Bayesian answer (“yes, but marginally”) is incorrect if the disputed assumption is false. l Explanatory question: Why do people believe that P(H|E) = P(H)? The Bayesian answer (“because they mistake marginal confirmation for confirmational irrelevance”) can be supplemented with: “because they mistakenly take the assumption to be true (and this is because they reason by indifference)”.