Part 2 Module 2 The Conditional Statement. The Conditional Statement A conditional statement is a statement of the form "If p, then q," denoted pqpq.

Slides:



Advertisements
Similar presentations
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.
Advertisements

The Conditional & Biconditional MATH 102 Contemporary Math S. Rook.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
Part 2 Module 2 The Conditional Statement. The Conditional Statement A conditional statement is a statement of the form "If p, then q," denoted pqpq.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
1 Intro to Logic Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Copyright © Cengage Learning. All rights reserved.
Conditional Statements
3.2 – Truth Tables and Equivalent Statements
Propositions and Truth Tables
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.4 Equivalent Statements.
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
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.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Discrete Mathematics and Its Applications
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
1 Introduction to Abstract Mathematics The Logic and Language of Proofs Instructor: Hayk Melikya Proposition: Informal introduction to.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
Conditional. Conditional Statements Vocabulary Conditional: A compound sentence formed by using the words if….then. Given the simple sentences p and 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
Chapter 7 Logic, Sets, and Counting
Thinking Mathematically Equivalent Statements, Conditional Statements, and De Morgan’s Laws.
Conditional Statements
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.
MADAM SITI AISYAH ZAKARIA. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC LOGICAL CONNECTIVES CONDITIONAL STATEMENT.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
Unit 01 – Lesson 07 – Conditional Statements
Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
How do I show that two compound propositions are logically equivalent?
Thinking Mathematically
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.
Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
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.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Chapter 1 Logic and proofs
Simple Logic.
Chapter 1 Logic and Proof.
2. The Logic of Compound Statements Summary
Conditional Statements
AND.
DISCRETE MATHEMATICS CHAPTER I.
Truth Tables for Negation, Conjunction, and Disjunction
How do I show that two compound propositions are logically equivalent?
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Equivalent Statements and Variations of Conditional Statements
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Section 3.4 Equivalent Statements
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Equivalent Statements
Equivalent Statements
Statements of Symbolic Logic
Truth Tables for the Conditional and Biconditional
CHAPTER 3 Logic.
Section 3.4 Equivalent Statements
Presentation transcript:

Part 2 Module 2 The Conditional Statement

The Conditional Statement A conditional statement is a statement of the form "If p, then q," denoted pqpq

Conditional statements EXAMPLE Let p represent: "You drink Pepsi." Let q represent: "You are happy." In this case p  q is the statement: "If you drink Pepsi, then you are happy."

Conditional statements - terminology In the conditional statement “If you drink Pepsi, then you are happy,” the simple statement “You drink Pepsi” is called the antecedent and the simple statement “You are happy” is called the consequent.

Variations, more terminology For a conditional statement such as “If you drink Pepsi, then you are happy,” there are three similar-sounding conditional statements that have special names: converse inverse contrapositive

Variations: the Converse Suppose a statement has the form p  q, such as “If you drink Pepsi, then you are happy.” (We will refer to this as the direct statement.) The related statement q  p is called the converse. “If you are happy, then you drink Pepsi” is the converse of “If you drink Pepsi, then you are happy.” We can also say that those two statements are converses of each other.

Variations: the Inverse Suppose the direct statement has the form p  q, such as “If you drink Pepsi, then you are happy.” The related statement ~p  ~q is called the inverse. “If you don’t drink Pepsi, then you aren’t happy” is the inverse of “If you drink Pepsi, then you are happy.” We can also say that those two statements are inverses of each other.

Variations: the Contrapositive Suppose the direct statement has the form p  q, such as “If you drink Pepsi, then you are happy.” The related statement ~q  ~p is called the contrapositive. “If you aren’t happy, then you don’t drink Pepsi” is the contrapositive of “If you drink Pepsi, then you are happy.” We can also say that those two statements are contrapositives of each other.

Exercise - variations Select the statement that is the inverse to ‘If you aren't a whale, then you don't live in the briny deep.’ A. If you don't live in the briny deep, then you aren't a whale. B. If you are a whale, then you live in the briny deep. C. If you live in the briny deep, then you are a whale. D. If you are a whale, then you don’t live in the briny deep. E. None of these.

Solution - variations Select the statement that is the inverse to ‘If you aren't a whale, then you don't live in the briny deep.' The inverse of a conditional statement is obtained by negating both the antecedent and the consequent. The inverse of ‘If you aren't a whale, then you don't live in the briny deep’ is ‘If you are a whale, then you live in the briny deep.’ The correct choice is B.

Truth table for p  q Refer to the particular statement “If you drink Pepsi, then you are happy” to fill in the truth table for p  q.

Truth table for p  q pq p  q TTT TFF FTT FFT

The Fundamental Property FUNDAMENTAL PROPERTY OF THE CONDITIONAL STATEMENT The only situation in which a conditional statement is FALSE is when the ANTECEDENT is TRUE while the CONSEQUENT is FALSE. T  F yields FALSE. Any other configuration yields TRUE.

Exercise #3 Suppose p is true, q is true, and r is false. Find the truth value of (p  ~q)  ~(q  ~r) A. True B. False

Solution #3 Suppose p is true, q is true, and r is false. Find the truth value of (p  ~q)  ~(q  ~r) (T  ~T)  ~(T  ~F) (T  F)  ~(T  T) F  ~(T) F  F TThe correct choice is “A. True”

Truth tables, tautologies Decide if the following statement is a tautology: [~q  (~p  q)]  p A. Yes, this statement is a tautology. B. No, this statement isn’t a tautology.

Truth tables, tautologies - solution Decide if the following statement is a tautology: [~q  (~p  q)]  p We will make a truth table. If the truth table column for [~q  (~p  q)]  p shows only “True,” then the statement is a tautology.

Truth tables, tautologies - solution p. 2 The truth table shows that the statement in the last column is a tautology.

Truth tables and equivalencies Select the statement that is equivalent to “If you are a dog, then you wag your tail when you are happy.” A. If you wag your tail when you are happy, then you are a dog. B. You aren’t a dog, or you wag your tail when you are happy. C. You are a dog, and you don’t wag your tail when you are happy. D. If you aren’t a dog, then you don’t wag your tail when you are happy.

Solution, page 1 Let p: “You are a dog.” q: “You wag you tail when you are happy.” We want to select a statement that is equivalent to p  q Based on the definitions of p, q above, here are the symbolic renditions of each multiple-choice answer. A. q  pB. ~p  qC. p  ~qD. ~p  ~q A truth table will show which of these choices is equivalent to p  q

Solution, page 2 The truth table shows that choice B is correct. That is, the statement p  q is equivalent to ~p  q.

Facts There are several generalizations that follow from the truth table in the previous exercise. Note that the column for p  q is different from the column for q  p: 1. A conditional statement is NOT equivalent to its converse. Note that the column for p  q is different from the column for ~p  ~q: 2. A conditional statement is NOT equivalent to its inverse. Note that the column for p  q is the same as the column for ~p  q: 3. p  q is equivalent to ~p  q Note that the column for p  q is exactly the opposite of the column for p  ~q: 4. The negation of p  q is p  ~q

An equivalency for “if p, then q” The truth table in the previous example confirms the following fact: p  q  ~p  q That is, you can change a conditional statement into an equivalent “or” statement, by negating the antecedent and switching the connective.

Exercise #4: equivalency Select that statement that is logically equivalent to: "If you don't carry an umbrella, you'll get soaked." A. You carry an umbrella and you won't get soaked. B. You carry an umbrella or you get soaked. C. You don't carry an umbrella and you get soaked. D. You don't carry an umbrella or you get soaked. E. You leave your umbrella in the classroom, so you get soaked anyway.

Negation of a conditional statement Based on the truth table we constructed in an earlier exercise, we have already made an observation about the correct form for the negation of a conditional statement. We can also use this equivalency: p  q  ~p  q to find the correct negation of p  q

Negation of p  q Summary: The negation of p  q is p  ~q Notice that the negation of an “if…then” statement doesn’t have any “ifs” or “thens.”

Negations: Summary In Part 2 Modules 1 and 2 we have seen five rules for negations. Here they are. Statement Negation Some A are B No A are B. All A are B.Some A aren’t B. p  q ~p  ~q p  q ~p  ~q p  q p  ~q

Exercise #5: Negation Select the statement that is the negation of "If a dog wags its tail, then it doesn't bite." A. A dog wags its tail and it bites. B. A dog wags its tail and it doesn't bite. C. A dog doesn't wag its tail or it bites. D. If a dog doesn't wag its tail, then it bites. E. None of these.

Another equivalency Select the statement that is the equivalent to "If I am a cloud, then I have a silver lining." A. If I have a silver lining, then I am a cloud. B. If I am not a cloud, then I don’t have a silver lining. C. If I don’t have a silver lining, then I am not a cloud. D. A, B, C are all equivalent to the given statement. E. None of these is correct. We will use a truth table to answer this question.

Equivalency The truth table in the previous exercise establishes the following fact: p  q  ~q  ~p That is, a conditional statement is equivalent to its contrapositive, but not equivalent to its converse or inverse. We now have two rules for equivalency: 1. p  q  ~p  q 2. p  q  ~q  ~p

Summary: The conditional statement Let A  B be any conditional statement. A is the antecedent. B is the consequent. Fundamental Rule The only situation that makes A  B false is when A is true while B is false. Negation The negation A  B of is A  ~B Two Equivalencies 1. A  B  ~A  B 2. A  B  ~B  ~A Variations Converse: B  AInverse: ~A  ~BContrapositive: ~B  ~A