AND.

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.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
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.
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
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
9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
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.
Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction
2.2 Truth Tables for Negation, Conjunction, and Disjunction.
 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.
© 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
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)
How do I show that two compound propositions are logically equivalent?
Truth Tables for Negation, Conjunction, and Disjunction
Geometry Pre-AP BOMLA LacyMath 10/6.
Logic – Bell Ringer.
Chapter 8 Logic Topics
3.5 Symbolic Arguments.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Copyright © Cengage Learning. All rights reserved.
TRUTH TABLES.
(1.4) An Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
The Logic of Declarative Statements
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
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
CHAPTER 3 Logic.
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.
Truth Tables for Conditional and Biconditional Statements
Interpreting Truth tables (biconditional statements)
Presentation transcript:

AND

Chapter 3 Logic

WHAT YOU WILL LEARN • Truth tables for negations, conjunctions, and disjunctions

Truth Tables for Negation, Conjunction, and Disjunction Section 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 p ~p Case 1 T F Case 2 F T

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

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

General Procedure for Constructing Truth Tables 1. Determine if the statement is a negation, conjunction, and disjunction The answer to the truth table appears under: ~ if it is a negation  if it is a conjunction V if it is a disjunction

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 they were completed.

Example: Construct a Truth Table Construct a truth table for p  ~q. Solution: Construct a standard four case truth table. Then fill-in the table in order, as follows: p q  ~ T F T F T F F T F T T F 1 4 3 2 True only when p is true and q is false.

Example: Truth Table with a Negation and Conjunction Construct a truth table for ~(~q  p). Solution: Construct a 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 False only when p is true and q is false.