Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional.

Slides:



Advertisements
Similar presentations
3.4 More on the Conditional
Advertisements

Logic ChAPTER 3.
3.2 Truth Tables for Negation, Conjunction, and Disjunction
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.
3 Logic The Study of What’s True or False or Somewhere in Between.
The Conditional & Biconditional MATH 102 Contemporary Math S. Rook.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Truth Tables for Negation, Conjunction, and Disjunction.
Logic ChAPTER 3.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Propositions and Truth Tables
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.4 Equivalent Statements.
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.
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-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,
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Section 3.5 Symbolic Arguments
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
Conditional. Conditional Statements Vocabulary Conditional: A compound sentence formed by using the words if….then. Given the simple sentences p and q,
Chapter 7 Logic, Sets, and Counting
Conditional Statements
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
How do I show that two compound propositions are logically equivalent?
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
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.
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.4, Slide 1 3 Logic The Study of What’s True or False or Somewhere in Between 3.
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.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
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.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
2.2 Truth Tables for Negation, Conjunction, and Disjunction.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Truth Tables for Negation, Conjunction, and Disjunction
AND.
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
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.
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Applications of Systems of Linear Equations
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Statements of Symbolic Logic
Section 3.3 Truth Tables for the Conditional and Biconditional
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
2-2 Logic Part 2 Truth Tables.
CHAPTER 3 Logic.
Truth Tables for Conditional and Biconditional Statements
Presentation transcript:

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional

Copyright 2013, 2010, 2007, Pearson, Education, Inc. What You Will Learn Truth tables for conditional and biconditional Self-contradictions, Tautologies, and Implications 3.3-2

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Conditional The conditional statement p → q is true in every case except when p is a true statement and q is a false statement pqp → q Case 1TTT Case 2TFF Case 3FTT Case 4FFT

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example: Truth Table with a Conditional Construct a truth table for the statement ~p → ~q

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example: Truth Table with a Conditional Solution Construct a standard four case truth table. pq~p~p → ~q~q TTFFTTFF TFTFTFTF F F T T T T F T F T F T It’s a conditional, the answer lies under →

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Biconditional The biconditional statement, p ↔ q means that p → q and q → p or, symbolically (p → q) ⋀ (q → p) order of steps FTFTFTFFFcase 4 FFTFTTFTFcase 3 TTFFFFTFTcase 2 TTTTTTTTT case 1 p)p)(q(qq)q)(p(pqp 3.3-6

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Biconditional The biconditional statement, p ↔ q is true only when p and q have the same truth value, that is, when both are true or both are false

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 4: A Truth Table Using a Biconditional Construct a truth table for the statement ~p ↔ (~q → r)

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 4: A Truth Table Using a Biconditional pqr~p~p ↔ (~q → r)r) TTTTFFFFTTTTFFFF TTFFTTFFTTFFTTFF T T T F T T T F F F F F T T T T T F T F T F T F F F T T F F T T TFTFTFTFTFTFTFTF F F F T T T T F 5

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Using Real Data in Compound Statements The graph on the next slide represents the student population by age group in 2009 for the State College of Florida (SCF). Use this graph to determine the truth value of the following compound statements

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Using Real Data in Compound Statements

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Using Real Data in Compound Statements If 37% of the SCF population is younger than 21 or 26% of the SCF population is age 21–30, then 13% of the SCF population is age 31–

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Using Real Data in Compound Statements Solution Let p: 37% of the SCF population is younger than 21. q: 26% of the SCF population is age 21–30. r: 13% of the SCF population is age 31–40. Original statement can be written: (p ⋁ q) → r

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Using Real Data in Compound Statements Solution Original statement: (p ⋁ q) → r p and r are true, q is false (T ⋁ F) → T T → T T The original statement is true

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Using Real Data in Compound Statements 3% of the SCF population is older than 50 and 8% of the SCF population is age 41–50, if and only if 19% of the SCF population is age 21–

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Using Real Data in Compound Statements Solution Let p:3% of the SCF population is older than 50. q:8% of the SCF population is age 41–50. r:19% of the SCF population is age 21–30. Original statement can be written: (p ⋀ q) ↔ r

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Using Real Data in Compound Statements Solution Original statement: (p ⋀ q) ↔ r p and q are true, r is false (T ⋀ T) ↔ F T ↔ F F The original statement is false

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Self-Contradiction A self-contradiction is a compound statement that is always false. When every truth value in the answer column of the truth table is false, then the statement is a self-contradiction

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 8: All Falses, a Self- Contradiction Construct a truth table for the statement (p ↔ q) ⋀ (p ↔ ~q)

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 8: All Falses, a Self- Contradiction Solution The statement is a self-contradiction or a logically false statement.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Tautology A tautology is a compound statement that is always true. When every truth value in the answer column of the truth table is true, the statement is a tautology

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 9: All Trues, a Tautology Construct a truth table for the statement (p ⋀ q) → (p ⋁ r)

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Solution The statement is a tautology or a logically true statement. Example 9: All Trues, a Tautology

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Implication An implication is a conditional statement that is a tautology. The consequent will be true whenever the antecedent is true

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 10: An Implication? Determine whether the conditional statement [(p ⋀ q) ⋀ q] → q is an implication

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 10: An Implication? Solution The statement is a tautology, so it is an implication.