Hypothetical Derivations Kareem Khalifa Department of Philosophy Middlebury College.

Slides:



Advertisements
Similar presentations
Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Advertisements

Introduction to Proofs
Four Rules of Aristotelian Logic 1. Rule of Identity: A is A 2. Rule of Non-Contradiction: A is not (-A) 3. Rule of Excluded Middle: Either A or (-A)
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.
February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers Example: Add a = (1110) 2 and b = (1011) 2. a 0 + b.
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
Refutation, Part 1: Counterexamples & Reductio Kareem Khalifa Philosophy Department Middlebury College.
Confidence Intervals for Proportions
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.
CSE115/ENGR160 Discrete Mathematics 02/07/12
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
Copyright © Zeph Grunschlag,
Existential Introduction Kareem Khalifa Department of Philosophy Middlebury College.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
Copyright © Cengage Learning. All rights reserved.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Mathematical Induction
Methods of Proof & Proof Strategies
Introduction to Proofs
Deduction, Induction, & Truth Kareem Khalifa Department of Philosophy Middlebury College.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
MATH 224 – Discrete Mathematics
Chains of Inference Kareem Khalifa Department of Philosophy Middlebury College.
0 Validity & Invalidity (Exercises) December 23, 2005.
Existential Elimination Kareem Khalifa Department of Philosophy Middlebury College 
Universal Introduction and Quantifier Exchange Rules.
Logic & Propositions Kareem Khalifa Department of Philosophy Middlebury College.
Proofs1 Elementary Discrete Mathematics Jim Skon.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
AP STATISTICS LESSON 10 – 2 DAY 1 TEST OF SIGNIFICANCE.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Symbolic Language and Basic Operators Kareem Khalifa Department of Philosophy Middlebury College.
Truth Tables and Validity Kareem Khalifa Department of Philosophy Middlebury College pqrSp v qr & s~(p v q)~p~q~p & ~q~(p v q) -> (r & s) (~p & ~q) ->
Validity and Counterexamples Kareem Khalifa Department of Philosophy Middlebury College.
Natural Deduction Proving Validity. The Basics of Deduction  Argument forms are instances of deduction (true premises guarantee the truth of the conclusion).
0 Validity & Invalidity (Exercises) All dogs have two heads. 2. All tigers are dogs. ___________________________________ 3. All tigers have two.
Basic Inference Rules Kareem Khalifa Department of Philosophy Middlebury College.
Study Questions for Quiz 1 1. The Concept of Validity (20 points) a. You will be asked to give the two different definitions of validity given in the lecture.
Proof of Invalidity Kareem Khalifa Department of Philosophy Middlebury College.
Overview Mathematical Induction Derivations Recursive Inference Parse Trees Equivalence of Inference, Derivations, and Parse Trees.
Fun with Deductive Reasoning
In this section, we will learn about: Differentiating composite functions using the Chain Rule. DERIVATIVES 3.5 The Chain Rule.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
2.3 Methods of Proof.
CS104:Discrete Structures Chapter 2: Proof Techniques.
More Proofs. REVIEW The Rule of Assumption: A Assumption is the easiest rule to learn. It says at any stage in the derivation, we may write down any.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
Theorems and Shortcuts Kareem Khalifa Department of Philosophy Middlebury College.
Tests of Significance We use test to determine whether a “prediction” is “true” or “false”. More precisely, a test of significance gets at the question.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
The Problem of the External World Kareem Khalifa Philosophy Department Middlebury College.
Proof Techniques CS160/CS122 Rosen: 1.5, 1.6, 1.7.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
Valid and Invalid Arguments
Formal Logic CSC 333.
Symbolic Language and Basic Operators
Existential Elimination
CS 220: Discrete Structures and their Applications
Propositional Logic.
Midterm Discussion.
Logical and Rule-Based Reasoning Part I
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Presentation transcript:

Hypothetical Derivations Kareem Khalifa Department of Philosophy Middlebury College

Overview What is a hypothetical derivation? Everyday examples Formal proofs and hypothetical derivations Sample Exercises

What is a hypothetical derivation? A proof made on the basis of a temporary assumption or hypothesis, which is not asserted to be true, but only supposed for the sake of argument.

Everyday examples: Suppose that you major in philosophy. Then your analytical reasoning skills will be honed, which in turn will increase your chances of rocking the LSAT. As a result, if you major in philosophy, you will be more likely to rock the LSAT. Suppose that Khalifa is a real SOB. Then he’d give us a pop quiz every day. Fortunately, he doesn’t do this. So Khalifa must not be an SOB.

Two Central Observations 1.Hypotheses are not asserted to be true, but only supposed for the sake of argument. 2.Nevertheless, these suppositions yield propositions which can be asserted and not merely supposed, specifically: –Conditional statements: If you major in philosophy, your chances of rocking the LSAT increase. –Negative statements: Khalifa is not an SOB.

How to represent these two observations formally Whenever you suppose something, indent it and draw a vertical line next to it. –You have now entered “the world of hypothesis.” Now proceed as if you had this hypothesis as an additional premise. In order to leave the world of hypothesis, you must follow one of two rules…

The two rules  I: Given a hypothetical derivation of ψ from Ф, end the derivation and infer (Ф  ψ). –In this case, (Ф  ψ) can be asserted “outside” of the world of hypothesis ~I: Given the hypothetical derivation of any formula of the form (ψ & ~ψ) from Ф, end the derivation and infer ~Ф. –In this case, ~Ф can be asserted “outside” of the world of hypothesis

Back to the everyday examples… Let P = you major in philosophy; Q = Your analytical skills improve; R = You’re more likely to rock the LSAT. The argument: P  Q, Q  R ├ P  R

The Proof 1.P  QA 2.Q  R A PRPR 3. |PH for  I 4. |Q1,3  E 5. |R 2,4  E 6.P  R3-5  I Suppose that you major in philosophy Then your analytical skills will improve Then you’re more likely to rock the LSAT

The Application of  I 1.P  QA 2.Q  R A  P  R 3. |PH for  I 4. |Q1,3  E 5. |R 2,4  E 6.P  R3-5  I  I: Given a hypothetical derivation of ψ from Ф, end the derivation and infer (Ф  ψ). Let Ф = P Let ψ = R Lines 3-5 are the hypothetical derivation.

The Las Vegas Rule… What happens in the world of hypothesis, stays in the world of hypothesis. In our previous proof, it would be invalid to assert anything inside the world of hypothesis outside of the world of hypothesis.

Example of what we CAN’T infer 1.P  QA 2.Q  R A 3. |PH for  I 4. |Q1,3  E 5. |R 2,4  E 6.P & R3, 5 &I WRONG! You’ve broken the Las Vegas Rule!

The wrongness in plain English… If you major in philosophy, then your analytical skills will improve. If your analytical skills improve, then you’re more likely to rock the LSAT. Thus you major in philosophy and you’re more likely to rock the LSAT. Clearly INVALID! So don’t violate the Las Vegas Rule.

What we CAN infer 1.P  QA 2.Q  R A 3. |PH for  I 4. |Q1,3  E 5. |R 2,4  E 6. |P & R3, 5 &I 7.P  (P&R)3-6  I

The other example… Let P = Khalifa is a real SOB; Q= Khalifa gives us a pop quiz every day. 1.P  QA 2.~QA  ~P 3. |PH for ~I 4. |Q1, 3  E 5. |Q & ~Q2, 4 &I 6.~P3-5 ~I ~I: Given the hypothetical derivation of any formula of the form (ψ & ~ψ) from Ф, infer ~Ф. Let Ф = P, ψ = Q The hypothetical derivation goes from lines 3-5.

Proof Strategies— VERY IMPORTANT! Memorize the strategies on Nolt, p. 99. –T–They are the key to getting partial credit on any proof exercise, since they show that you have some clue about how to go about constructing a proof. Start tackling every proof by asking the following two questions: 1.What is the main operator of my conclusion? 2.What is the proof strategy that corresponds to that operator? Very important! Very Important! Very Important! Very Important! Very Important!

Sample Exercises, Nolt (P v Q)  R A  P  R 2. |PH for  I 3. | P v Q2 vI 4. | R 1,3  E 5.P  R2-4  I

Sample Exercise, Nolt (P&Q)  RA  P  (Q  R) 2.|PH for  I 3.||QH for  I 4.||P&Q2,3 &I 5.||R1,4  E 6.|Q  R3-5  I 7.P  (Q  R)2-6  I

~~P v ~~QA  P v Q 2.|~~PH for  I 3.|P2 ~E 4.|P v Q3 vI 5.~~P  (P v Q)2-4  I 6.|~~QH for  I 7.|Q6 ~E 8.|P v Q7 vI 9.~~Q  (P v Q)6-8  I 10.P v Q1,5,9 vE

~(P&Q)A  P  ~Q 2.|PH for  I 3.||QH for ~I 4.||P & Q2,3 &I 5.||(P&Q) & ~(P&Q)1,4 &I 6.|~Q3-5 ~I 7.P  ~Q2-6  I