Truth Tables for Negation, Conjunction, and Disjunction

Slides:



Advertisements
Similar presentations
3.2 Truth Tables for Negation, Conjunction, and Disjunction
Advertisements

Truth Functional Logic
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
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.
2.2 Statements, Connectives, and Quantifiers
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Conjunction A conjunction is a compound statement formed by combining two simple sentences using the word “AND”. A conjunction is only true when both.
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.
Thinking Mathematically
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Logic Eric Hoffman Advanced Geometry PLHS Sept
Lesson 1.4 Equations and Inequalities Goal: To learn how to solve equations and check solutions of equations and inequalities.
9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.
Warm-Up Let A = {0,1,3,8}, B = {2,4,5,6,7,9}, and C = {0,1,8}. 4 minutes Find the following sets.
Lesson 2-2.B Logic: Truth Tables. 5-Minute Check on Lesson 2-2.A Transparency 2-2 Make a conjecture about the next item in the sequence. 1. 1, 4, 9, 16,
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Introductory Logic PHI 120 Presentation: "Truth Tables – Sentences"
 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.
WARM UP Graph the following inequalities: a. x ≤ 1 b. x < 2 3. – 4x – 3 < (1 – x ) ≥ 3.
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
Conditional Statements
1-4 Solving Inequalities
AND.
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
1-5 Equations Goals: Solve equations with one variable
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
How do I show that two compound propositions are logically equivalent?
Truth Tables for Negation, Conjunction, and Disjunction
Logic – Bell Ringer.
3.5 Symbolic Arguments.
Solving Equations with Variables on Both Sides Day 2
TRUTH TABLES.
TRUTH TABLES continued.
(1.4) An Introduction to Logic
2.5 Solving Compound Inequalities
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
The Logic of Declarative Statements
Truth tables 3.2 and 3.3 Constructing Truth tables
Statements joined by “And” (Conjunctions)
Discrete Mathematics Lecture 2: Propositional Logic
Equivalent Statements
Statements of Symbolic Logic
Section 3.7 Switching Circuits
CHAPTER 3 Logic.
Algebra 1 Section 4.5.
And represent them using Venn Diagrams.
Introductory Logic PHI 120
CHAPTER 3 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
Statements and Logical Connectives
Solving Equations with Variables on Both Sides Day 2
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:

Truth Tables for Negation, Conjunction, and Disjunction 3.2 Truth Tables for Negation, Conjunction, and Disjunction

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

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

Four case Truth table p q T F

8 case Truth table p q r T F

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

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

General Procedure for 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 V if it is a disjunction g if it is conditional 1 if it is biconditional

General Procedure for Constructing Truth Tables (continued) 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 first. 3. Complete the column under the connective within parentheses, if present. You will use the truth values of the connective in determining the final answer in step 5. 4. Complete the column under any remaining statements and their negation.

General Procedure for Constructing Truth Tables (continued) 5. Complete the column under any remaining connectives. 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. For a negation, negate the values of the last column completed within the grouping symbols on the right of the negation. Number the columns in the order the were completed.

Example: Truth Table with a Negation Construct a truth table for ~(~q ^p). Solution: Construct standard four case truth table. Then fill-in the table in order, as follows: p q ~ (~q ^ p) T F T F T F F T F T T F 4 1 3 2

Example: Truth Table with a Negation Construct a truth table for q v ~p. Solution: Construct standard four case truth table. Then fill-in the table in order, as follows: p q v ~p T F T F T F T F F T 1 3 2

Example: construct a truth table for the statement (p ^ r) v q Column #3 is the answer to the parentheses. p T F ^ T F r T F v T F q T F Use column #3 and #4 to find answer column #5 1 3 2 5 4

Example: Determine the truth value if p is True, q is false and r is false. 1. (p v q) ^ ~r 2. ~(p ^ ~r) v q T T F T T F T T T F F 1 3 2 5 4 4 1 3 2 6 5 Notice in these problems we are only solving the problems for the one case proviede.

Homework p. 114 # 6 – 66 (by 3)