Section 3.3 Truth Tables for the Conditional and Biconditional

Slides:



Advertisements
Similar presentations
Chapter 21: Truth Tables.
Advertisements

04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Notes on Logic Continued
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Adapted from Discrete Math
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 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.
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.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Objectives: To solve and graph simple and compound inequalities.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Unit 01 – Lesson 07 – Conditional Statements
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional.
Thinking Mathematically
Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
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.
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.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
2. The Logic of Compound Statements Summary
The Foundations: Logic and Proofs
AND.
CSNB 143 Discrete Mathematical Structures
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.
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Discrete Mathematics Lecture # 2.
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1.2 Propositional Equivalences
Propositional Equivalences
Information Technology Department
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
3.5 Symbolic Arguments.
2.2 Analyze Conditional Statements
Section 3.4 Equivalent Statements
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
1.2 Propositional Equivalences
Equivalent Statements
Statements of Symbolic Logic
Section 3.7 Switching Circuits
CHAPTER 3 Logic.
1.2 Propositional Equivalences
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
1.3 Propositional Equivalences
CHAPTER 3 Logic.
Section 3.4 Equivalent Statements
2-2 Logic Part 2 Truth Tables.
CHAPTER 3 Logic.
3.5 Symbolic Arguments.
Truth Tables for Conditional and Biconditional Statements
Propositional Satisfiability
Presentation transcript:

Section 3.3 Truth Tables for the Conditional and Biconditional

What You Will Learn Truth tables for conditional and biconditional Self-contradictions, Tautologies, and Implications

Conditional p q p → q Case 1 T Case 2 F Case 3 Case 4 The conditional statement p → q is true in every case except when p is a true statement and q is a false statement.

Example: Truth Table with a Conditional Construct a truth table for the statement ~p → ~q.

Example: Truth Table with a Conditional Solution Construct a standard four case truth table. p q ~p → ~q T F T F F T T F F T 1 3 2 It’s a conditional, the answer lies under →.

Biconditional The biconditional statement, p ↔ q means that p → q and q → p or, symbolically (p → q) ⋀ (q → p). 5 6 4 7 2 3 1 order of steps F T case 4 case 3 case 2 case 1 p) (q q) (p q p

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.

Example 4: A Truth Table Using a Biconditional Construct a truth table for the statement ~p ↔ (~q → r).

Example 4: A Truth Table Using a Biconditional q r ~p ↔ (~q → r) T F T F T F F T F T F T T F T F 1 5 2 4 3

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.

Example 7: Using Real Data in Compound Statements

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–40.

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

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.

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–30.

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

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.

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.

Example 8: All Falses, a Self-Contradiction Construct a truth table for the statement (p ↔ q) ⋀ (p ↔ ~q).

Example 8: All Falses, a Self-Contradiction Solution The statement is a self-contradiction or a logically false statement.

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.

Example 9: All Trues, a Tautology Construct a truth table for the statement (p ⋀ q) → (p ⋁ r).

Example 9: All Trues, a Tautology Solution The statement is a tautology or a logically true statement.

Implication An implication is a conditional statement that is a tautology. The consequent will be true whenever the antecedent is true.

Example 10: An Implication? Determine whether the conditional statement [(p ⋀ q) ⋀ q] → q is an implication.

Example 10: An Implication? Solution The statement is a tautology, so it is an implication.