Truth Tables for Negation, Conjunction, and Disjunction

Slides:



Advertisements
Similar presentations
Truth Functional Logic
Advertisements

Using “So what is the Truth” Template Copy the presentation to your hard drive. Open the slides using slide sorter and copy slides #3, 4, and 5 for each.
Introduction to Symbolic Logic
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.
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.
Adapted from Discrete Math
3.2 – Truth Tables and Equivalent Statements
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Splash Screen. Then/Now You found counterexamples for false conjectures. (Lesson 2–1) Determine truth values of negations, conjunctions, and disjunctions,
Propositions and Truth Tables
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
1.4 Truth Tables. Compound Statement Conditional Statement(s) Biconditional Statement(s) Conjunction ( and ) Disjunction ( or )
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
1 Section 1.1 A Proof Primer A proof is a demonstration that some statement is true. We normally demonstrate proofs by writing English sentences mixed.
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.
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.
Review Given p: Today is Thursday q: Tomorrow is Friday
Thinking Mathematically
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.
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,
 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.
PHIL 012 2/14/2001 Logical Equivalence & Translation.
Section 3.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.
Presented by: Tutorial Services The Math Center
Lesson 2-2.A Logic: Venn Diagrams.
AND.
DISCRETE MATHEMATICS CHAPTER I.
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)
Truth Tables for Negation, Conjunction, and Disjunction
Logic – Bell Ringer.
The Lost Art of Argument
Section 3.5 Symbolic Arguments
3.5 Symbolic Arguments.
TRUTH TABLES.
TRUTH TABLES continued.
Opening hexagon A _____________________ has six sides.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
Truth tables 3.2 and 3.3 Constructing Truth tables
Warm Up:.
Discrete Mathematics Lecture 2: Propositional Logic
Equivalent Statements
Statements of Symbolic Logic
Section 3.7 Switching Circuits
And represent them using Venn Diagrams.
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
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.

Conjunction Truth Table Click on speaker for audio The symbol ^ is read as “and” 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 Click on speaker for audio The symbol V is read as “or” 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

Making a truth table Let’s construct a truth table for p v ~q. This is read as “p or not q”. Step 1: Make a table with different possibilities for p and q .There are 4 different possibilities. F Case 4 T Case 3 Case 2 Case 1 q p

Making a truth table (cont’d) Click on speaker for audio Step 2: Now, make a column for ~q (“not” q) since we want to ultimately find p v ~q T F Case 4 Case 3 Case 2 Case 1 ~q q p

Making a truth table (cont’d) Step 3: Next, make a column for p v ~q. Use the first and third columns to decide the truth values for p v ~q The truth table is now finished. p q ~q p v~q T F

Check it out Use the truth table above to decide the truth value of p V ~q if p is false and q is true. (Answer: p V ~q is false)

Next steps Read Examples 1-6 Work problems 5-13,odds; 43-50,all; 51-54,all from p. 115 in text Do online homework for Sec . 3.2

Truth Tables for the Conditional and Biconditional 3.3 Truth Tables for the Conditional and Biconditional

Conditional Click on speaker for audio p -> q is read as “if p then q” The conditional statement is true in every case except when p is a true statement and q is a false statement. T F Case 4 Case 3 Case 2 Case 1 q p

Biconditional 5 6 4 7 2 3 1 F T case 4 case 3 case 2 case 1 p) (q q) Click on speaker for audio The biconditional statement, means that and or, symbolically Take these 2 columns to get column 7 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

Next steps Read Examples 1 and 5 only Work problems 7-13, odds; 71-76, all from p. 125 in text Do online homework for Sec . 3.3 Do online quiz for 3.2 and 3.3