Conditional Statements & Material Implication Kareem Khalifa Department of Philosophy Middlebury College.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Logic & Critical Reasoning
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
Exercises with the Material Conditional
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
CS128 – Discrete Mathematics for Computer Science
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
Let remember from the previous lesson what is Knowledge representation
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
Discussion #9 1/9 Discussion #9 Tautologies and Contradictions.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Satisfiability & Logical Truth PHIL /16/2001.
3.2 – Truth Tables and Equivalent Statements
Logic ChAPTER 3.
The Foundations: Logic and Proofs
Propositional Logic.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
Discrete Maths 2. Propositional Logic Objective
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Deduction, Induction, & Truth Kareem Khalifa Department of Philosophy Middlebury College.
Conditional Statements and Material Implication. The Conditional: The Fourth Connective Conditional statement: when two statements are combined by placing.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Reason and Argument Chapter 6 (2/3). A symbol for the exclusive ‘or’ We will use ұ for the exclusive ‘or’ Strictly speaking, this connective is not necessary.
Adapted from Patrick J. Hurley, A Concise Introduction to Logic (Belmont: Thomson Wadsworth, 2008).
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Symbolic Language and Basic Operators Kareem Khalifa Department of Philosophy Middlebury College.
Logic Review. FORMAT Format Part I 30 questions 2.5 marks each Total 30 x 2.5 = 75 marks Part II 10 questions Answer only 5 of them! Total 5 x 5 marks.
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) ->
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
PHIL 120: Third meeting I. I. What to know for Test 1 (in general terms). II. II. Symbolizing compound sentences (cont’d) a. a. Paying attention to English.
How do I show that two compound propositions are logically equivalent?
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
1 Propositional Logic Introduction. 2 What is propositional logic? Propositional Logic is concerned with propositions and their interrelationships. 
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Statement Forms and Material Equivalence Kareem Khalifa Department of Philosophy Middlebury College.
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
Outline Logic Propositional Logic Well formed formula Truth table
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
3.3 – The Conditional A conditional statement is a compound statement that uses the connective if…then. The conditional is written with an arrow, so “if.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Symbolic Language and Basic Operators
Principles of Computing – UFCFA3-30-1
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
TRUTH TABLES.
Presentation transcript:

Conditional Statements & Material Implication Kareem Khalifa Department of Philosophy Middlebury College

Overview  Why this matters  Anatomy of a conditional statement  Some nuances in translating conditionals  Truth-conditions for   Weirdness with  Possible solutions: Your first foray into philosophy of logic!  Sample Exercises

Why this matters  Conditional statements are the most fundamental logical connectives, so understanding their truth- conditions is necessary for analyzing and criticizing many arguments. A “cheap trick” for making any argument valid.  Sally is under 18.  If Sally is under 18, then she’s not allowed on the premises. So she’s not allowed on the premises.

Anatomy of conditionals  If you study hard, then you will pass PHIL0180.  If p, then q. ANTECEDENT CONSEQUENT

Some nuances in translating conditionals  “If p then q” can also be expressed in the following ways: If p, q q, if p p only if q p is sufficient for q q is necessary for p p requires q  p entails q  p implies q  p renders (yields, produces, etc.) q  In case of p, q  Provided that p, q  Given that p, q  On the condition that p, q

Examples  If Khalifa is human, then Khalifa is a mammal.  Khalifa’s being human suffices for his being a mammal.  Khalifa’s being a mammal is necessary for his being human.  Khalifa’s humanity requires that he be a mammal.  Khalifa’s humanity entails that he is a mammal.

More examples  Washing your hands decreases the chance of infection.  If you wash you your hands, then the chance of infection decreases.  Paying off the professor will produce the desired effect.  If the professor is paid off, then the desired effect will be produced. $$

Truth conditions for conditionals  Recall: A logical connective is a piece of logical syntax that: Operates upon propositions; and Forms a larger (compound) proposition out of the propositions it operates upon, such that the truth of the compound proposition is a function of the truth of its component propositions.  Today, we’re looking at “IF…THEN...” The truth of the whole “if-then” statement is a function of the truth/falsity of the antecedent and consequent.

Truth-conditions for   In logic, we represent “if p then q” as “p  q.” This is called material implication.  Alternatively, “” may be represented as “.”  “pq” is false if antecedent p is true and consequent q is false; otherwise, true. pq p  q TT TF FT FF T F T T

Intuitive examples of   True antecedent, true consequent If Khalifa is human, then Khalifa is a mammal.  False antecedent, true consequent If Khalifa is a dog, then Khalifa is a mammal.  False antecedent, false consequent If Khalifa is a dog, then Khalifa is a canine.

Weirdness with   True antecedent, true consequent If 2+2=4, then Middlebury is in VT.  False antecedent, true consequent If the moon is made of green cheese, then 2+2 =4.  False antecedent, false consequent If Khalifa is a dog, then the moon is made of green cheese.

More weirdness: the paradoxes of material implication  The following are both valid arguments  B, so A  B Ex. 2+2=4, so if unicorns exist, then 2+2=4.  ~A, so A  B Ex. The moon is not made of green cheese, so if the moon is made of green cheese, then Khalifa is a lizard.

Different responses to the weirdness  Response 1: Logic must be revised!  The English “If p then q” is just elliptical for “Necessarily, if p then q.” 2+2 = 4 doesn’t necessitate anything about Middlebury, nor does the moon’s green cheesiness necessitate anything about arithmetic, etc.  Ex. Although it is actually the case that 2+2 = 4 and Midd is in VT, it is possible that 2+2=4 and Midd is not in VT.  Thus it is not necessary that this conditional be true.

Response 2 (Copi & Cohen’s)  “If … then…” statements in English express several different relationships: Logical: If either Pat or Sam is dating Chris and Sam is not dating Chris, then Pat is dating Chris. Definitional: If a critter is warm-blooded, then that critter has a relatively high and constant internally regulated body temperature relatively independent of its surroundings. Causal: If I strike this match, then it will ignite. Decisional: If the median raw score on the exam is 60, then I should institute a curve.  Each of these if-then statements is false when the antecedent is true and the consequent is false.  This is exactly what material conditionals state, and thus they capture the “core” of all conditional statements. The rest is an issue of context.

Response 3  Suppose that the English “If p then q” is true.  Either ~p is true or p is true.  In the first case, ~p v q is true.  In the second case, q is true by modus ponens.  Thus, in either case ~p v q is true.  Since ~p v q is equivalent to p  q, the latter is a fair interpretation of “If p then q.”

More on Response 3 pq~p~p v q p  q TTT TFF FTT FFT F F T T T F T T

Exercise A6  (X  Y)  Z  (F  F)  F  (T)  F FF

Exercise A22  {[A (BC)] [(A&B) C]} [(YB) (CZ)]  {[T (TT)] [(T&T) T]} [(FT) (TF)]  {[T (T)] [(T) T]} [(T) (F)]  {[T (T)] [(T) T]} [F]  {[T] [T]} [F]  {T} [F] FF STOP & THINK!

Exercise B11  (P  X)  (X  P)  (P  F)  (F  P)  (P  F)  (T) TT

Exercise B24  [P  (A v X)]  [(P  A)  X]  [P  (T v F)]  [(P  T)  F]  [P  (T)]  [(T)  F]  [T]  [F] FF

Exercise C22  Argentina’s mobilizing is a necessary condition for Chile to call for a meeting of all the Latin American states.  C  A

Exercise C25  If neither Chile nor the DR calls for a meeting of all the Latin American states, then Brazil will not protest to the UN unless Argentina mobilizes.  (~C & ~D)  (~B v A)