Truth Tables and Equivalent Statements

Slides:

Advertisements

Similar presentations

TRUTH TABLES Section 1.3.

Advertisements

Truth Tables How to Make and Use. Making a Truth Table To determine the number of rows other than the heading row. To determine the number of rows other.

CS128 – Discrete Mathematics for Computer Science

Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

Predicates and Quantifiers

3.2 – Truth Tables and Equivalent Statements

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.

Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

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.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.

Chapter 7 Logic, Sets, and Counting

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.

Unit 01 – Lesson 07 – Conditional Statements

Thinking Mathematically

COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.

Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.

 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.

TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.

Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.

 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.

Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.

 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.

Chapter 1 Propositional Logic

Introduction to Logic © 2008 Pearson Addison-Wesley.

Truth Tables for Negation, Conjunction, and Disjunction

Presented by: Tutorial Services The Math Center

DISCRETE MATHEMATICS CHAPTER I.

Thinking Mathematically

CHAPTER 3 Logic.

Truth Tables for Negation, Conjunction, and Disjunction

Chapter 3: Introduction to Logic

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Truth Tables for Negation, Conjunction, and Disjunction

Discrete Mathematics Lecture # 2.

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Logic – Bell Ringer.

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Propositional Equivalences

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

MAT 142 Lecture Video Series

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Section 3.4 Equivalent Statements

TRUTH TABLES continued.

(1.4) An Introduction to Logic

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Discrete Mathematics Lecture 2: Propositional Logic

Equivalent Statements

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

Discrete Mathematics Lecture 2: Propositional Logic

Equivalent Statements

Statements of Symbolic Logic

Section 3.7 Switching Circuits

Section 3.3 Truth Tables for the Conditional and Biconditional

Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction

CHAPTER 3 Logic.

Section 3.4 Equivalent Statements

2-2 Logic Vocab Statement: A sentence that is either true or false

CHAPTER 3 Logic.

Presentation transcript:

Truth Tables and Equivalent Statements Section 3-2 Truth Tables and Equivalent Statements

Truth Tables and Equivalent Statements Find the truth value of a conjunction. Find the truth value of a disjunction. Find the truth values for compound mathematical statements. Construct truth tables for compound statements. Understand and determine equivalence of statements. Use De Morgan’s laws to find negations of compound statements.

Conjunctions The truth values of component statements are used to find the truth values of compound statements. The truth values of the conjunction p and q, symbolized , are given in the truth table on the next slide. The connective and implies “both.”

Conjunction Truth Table p and q p q T T T T F F F T F F

Example: Finding the Truth Value of a Conjunction Let p represent the statement 4 > 1 and q represent the statement 12 < 9. Find the truth value of Solution False, since q is false.

Disjunctions The truth values of the disjunction p or q, symbolized , are given in the truth table on the next slide. The connective or implies “either.”

Disjunctions p or q p q T T T T F F T F F F

Example: Finding the Truth Value of a Disjunction Let p represent the statement 4 > 1 and q represent the statement 12 < 9. Find the truth value of Solution True, since p is true.

Negation The truth values of the negation of p, symbolized are given in the truth table below. not p p T F

Example: Mathematical Statements Let p represent the statement 4 > 1, q represent the statement 12 < 9, and r represent the statement 0 < 1. Decide whether each statement is true or false. Solution a) False, since ~ p is false. b) True

More Examples

You Try!!

Truth Tables Use the following standard format for listing the possible truth values in compound statements involving two component statements. p q Compound Statement T T T F F T F F

Example: Constructing a Truth Table Construct the truth table for Solution p q ~ p ~ q T T F T F T F T F F

Another Example

Another Example

You Try!!

Number of Rows in a Truth Table A logical statement having n component statements will have 2n rows in its truth table.

Example

You Try!!

Equivalent Statements Two statements are equivalent if they have the same truth value in every possible situation.

Example: Equivalent Statements Are the following statements equivalent? Solution Yes, see the tables below. p q T T F T F F T F F T

De Morgan’s Laws For any statements p and q:

Example: Applying De Morgan’s Laws Find a negation of each statement by applying De Morgan’s Laws. a) I got an A or I got a B. b) She won’t try and he will succeed. Solution a) I didn’t get an A and I didn’t get a B. b) She will try or he won’t succeed.

You Try!!