Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction

Slides:



Advertisements
Similar presentations
Truth Functional Logic
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.
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.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Truth Tables for Negation, Conjunction, and Disjunction.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Statements & Truth Tables True or False This statement is true or false.? A T/F statement is a declarative sentence. It has a value of true or false, but.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Thinking Mathematically
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Compound Inequalities A compound inequality is either two inequalities separated by a word, or an expression in between two inequality symbols.
Introduction to Logic Lecture 13 An Introduction to Truth Tables By David Kelsey.
 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. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction
2.2 Truth Tables for Negation, Conjunction, and Disjunction.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.
Simple Logic.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
1-4 Solving Inequalities
AND.
DISCRETE MATHEMATICS CHAPTER I.
Compound Inequalities
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
Critical Reasoning Lecture 16 An Introduction to Truth Tables
Truth Tables for Negation, Conjunction, and Disjunction
Equations and Inequalities
2 Chapter Introduction to Logic and Sets
Section 3.1 Statements and Logical Connectives
3.5 Symbolic Arguments.
Section 3.4 Equivalent Statements
TRUTH TABLES.
TRUTH TABLES continued.
(1.4) An Introduction to Logic
1 Chapter An Introduction to Problem Solving
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
1 Chapter An Introduction to Problem Solving
Truth tables 3.2 and 3.3 Constructing Truth tables
Statements joined by “And” (Conjunctions)
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
Section 3.7 Switching Circuits
CHAPTER 3 Logic.
And represent them using Venn Diagrams.
Introductory Logic PHI 120
Section 3.3 Truth Tables for the Conditional and Biconditional
Truth Tables for the Conditional and Biconditional
Statements and Logical Connectives
Section 3.4 Equivalent Statements
6.3 Using Elimination to Solve Systems
2-2 Logic Part 2 Truth Tables.
2-2 Logic Vocab Statement: A sentence that is either true or false
CHAPTER 3 Logic.
3.5 Symbolic Arguments.
Interpreting Truth tables (biconditional statements)
Presentation transcript:

Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction

What You Will Learn Truth tables for negations, conjunctions, and disjunctions

Truth Table A truth table is used to determine when a compound statement is true or false.

Negation Truth Table p ~p Case 1 T F Case 2

Compound Statement Truth Table q Case 1 T Case 2 F Case 3 Case 4

Conjunction Truth Table p q p ⋀ q Case 1 T Case 2 F Case 3 Case 4 The conjunction is true only when both p and q are true.

Disjunction Truth Table The disjunction is true when either p is true, q is true, or both p and q are true. p q p ⋁ q Case 1 T Case 2 F Case 3 Case 4

Negation Negation ~p is read “not p.” If p is true, then ~p is false; if p is false, then ~p is true. In other words, ~p will always have the opposite truth value of p.

Conjunction Conjunction p ⋀ q is read “p and q.” p ⋀ q is true only when both p and q are true

Disjunction Disjunction p ⋁ q is read “p or q.” p ⋁ q is true when either p is true or q is true, or both p and q are true. In other words, p ⋁ q is false only when both p and q are false.

Constructing Truth Tables 1. Determine if the statement is a negation, conjunction, disjunction, conditional, or biconditional. The answer to the truth table appears under: ~ if it is a negation ⋀ if it is a conjunction ⋁ if it is a disjunction → if it is conditional ↔ if it is biconditional

Constructing Truth Tables 2. Complete the columns under the simple statements, p, q, r, and their negations ~p, ~q, ~r, within parentheses, if present. If there are nested parentheses work with the innermost pair first.

Constructing Truth Tables 3. Complete the column under the connective within the parentheses, if present. You will use the truth values of the connective in determining the final answer in step 5.

Constructing Truth Tables 4. Complete the column under any remaining statements and their negation.

Constructing Truth Tables 5. Complete the column under any remaining connectives. The answer will appear under the column determined in step 1. For a conjunction, disjunction, conditional or biconditional, obtain the value using the last column completed on the left side and on the right side of the connective.

Constructing Truth Tables 5. (continued) For a negation, negate the values of the last column completed within the grouping symbols on the right of the negation. Circle or highlight the answer column and number the columns in the order they were completed.

Example 3: Truth Table with a Negation Construct a truth table for ~(~q ⋁ p).

Example 3: Truth Table with a Negation Construct a truth table for ~(~q ⋁ p). Solution p q ~ (~q ⋁ p) T F T F F T F T T F T F 4 1 3 2 False only when p is false and q is true.

Example 7: Use the Alternative Method to Construct a Truth Table Construct a truth table for ~p ⋀ ~q.

Example 7: Use the Alternative Method to Construct a Truth Table Solution Construct a truth table with four cases. p q T F T F

Example 7: Use the Alternative Method to Construct a Truth Table Solution Add a column for ~p ⋀ ~q. Use columns ~p and ~q to find ~p⋀~q. p q ~p ~q ~p ⋀ ~q T F T F F T F T F T It is true only when ~p and~q are true.

Example 9: Determine the Truth Value of a Compound Statement Determine the truth value for each simple statement. Then, using these truth values, determine the truth value of the compound statement. 15 is less than or equal to 9.

Example 9: Determine the Truth Value of a Compound Statement Solution Let p: 15 is less than 9. q: 15 is equal to 9. Express “15 is less than or equal to 9” as p ⋁ q. Both p and q are false. p ⋁ q F ⋁ F F

Example 9: Determine the Truth Value of a Compound Statement Determine the truth value for each simple statement. Then, using these truth values, determine the truth value of the compound statement. George Washington was the first U.S. president or Abraham Lincoln was the second U.S. president, but there has not been a U.S. president born in Antarctica.

Example 9: Determine the Truth Value of a Compound Statement Solution Let p: George Washington was the first U.S. president. q: Abraham Lincoln was the second U.S. president. r: There has been a U.S. president who was born in Antarctica. The statement can be written in symbolic form as (p ⋁ q) ⋀ ~r.

Example 9: Determine the Truth Value of a Compound Statement Solution p: George Washington was the first U.S. president. q: Abraham Lincoln was the second U.S. president. r: There has been a U.S. president who was born in Antarctica. The statement is (p ⋁ q) ⋀ ~r. p is true, q is false, r is false. Since r is false, ~r is true.

Example 9: Determine the Truth Value of a Compound Statement Solution The statement is (p ⋁ q) ⋀ ~r. p is true, q is false, ~r is true. (p ⋁ q) ⋀ ~r (T ⋁ F) ⋀ T T ⋀ T T The original compound statement is true.