Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.

Slides:



Advertisements
Similar presentations
Geometry Logic.
Advertisements

TRUTH TABLES Section 1.3.
3.2 Truth Tables for Negation, Conjunction, and Disjunction
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Constructing a Truth Table
Logic & Critical Reasoning
Combining what we have already talked about! Conditional Statements: If_______________ then _____________________.HypothesisConclusion Change the following.
Chapter 3 section 2. Please form your groups The 1 st column represents all possibilities for the statement that can be either True or False. The 2 nd.
Truth Tables Presented by: Tutorial Services The Math Center.
Aim: Logic – Conjunction/Disjunction Course: Math Lit. Do Now: Aim: What is the conjunction and disjunction of the truth? True or False Math is a 4-letter.
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
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.
The Foundations: Logic and Proofs
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
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 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
MATH 102 Contemporary Math S. Rook
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.2 Truth Tables.
3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)
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.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
How do I show that two compound propositions are logically equivalent?
Review Given p: Today is Thursday q: Tomorrow is Friday
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional.
Thinking Mathematically
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
UNIT 01 – LESSON 10 - LOGIC ESSENTIAL QUESTION HOW DO YOU USE LOGICAL REASONING TO PROVE STATEMENTS ARE TRUE? SCHOLARS WILL DETERMINE TRUTH VALUES OF NEGATIONS,
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
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.
Ms. Andrejko 2-2 Logic. Real World Legally Blonde.
Welcome to Interactive Chalkboard Glencoe Geometry Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Developed by FSCreations, Inc.,
 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.
Chapter 1 Logic and proofs
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.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Truth Tables for Negation, Conjunction, and Disjunction
AND.
Thinking Mathematically
Truth Tables for Negation, Conjunction, and Disjunction
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Statements of Symbolic Logic
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
Presentation transcript:

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction

Copyright 2013, 2010, 2007, Pearson, Education, Inc. What You Will Learn Truth tables for negations, conjunctions, and disjunctions 3.2-2

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Truth Table A truth table is used to determine when a compound statement is true or false

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Negation Truth Table p~p~p Case 1TF Case 2FT

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Compound Statement Truth Table pq Case 1TT Case 2TF Case 3FT Case 4FF

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Conjunction Truth Table The conjunction is true only when both p and q are true pq p ⋀ q Case 1TTT Case 2TFF Case 3FTF Case 4FFF

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Disjunction Truth Table The disjunction is true when either p is true, q is true, or both p and q are true pq p ⋁ q Case 1TTT Case 2TFT Case 3FTT Case 4FFF

Copyright 2013, 2010, 2007, Pearson, Education, Inc. 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

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Conjunction Conjunction p ⋀ q is read “p and q.” p ⋀ q is true only when both p and q are true 3.2-9

Copyright 2013, 2010, 2007, Pearson, Education, Inc. 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

Copyright 2013, 2010, 2007, Pearson, Education, Inc. 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

Copyright 2013, 2010, 2007, Pearson, Education, Inc. 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

Copyright 2013, 2010, 2007, Pearson, Education, Inc. 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

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Constructing Truth Tables 4.Complete the column under any remaining statements and their negation

Copyright 2013, 2010, 2007, Pearson, Education, Inc. 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

Copyright 2013, 2010, 2007, Pearson, Education, Inc. 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

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 3: Truth Table with a Negation Construct a truth table for ~(~q ⋁ p)

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 3: Truth Table with a Negation Construct a truth table for ~(~q ⋁ p). Solution pq~(~q ⋁ p)p) TTFFTTFF TFTFTFTF F F T F F T F T T T F T T T F F False only when p is false and q is true

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Try This Construct a truth table for the following: ~p ^q

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Use the Alternative Method to Construct a Truth Table Construct a truth table for ~p ⋀ ~ q

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Use the Alternative Method to Construct a Truth Table Construct a truth table with four cases. Solution pq TTFFTTFF TFTFTFTF

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 7: Use the Alternative Method to Construct a Truth Table Add a column for ~p ⋀ ~q. Use columns ~p and ~q to find ~p ⋀ ~q. Solution pq TTFFTTFF TFTFTFTF ~p~p ~q~q FFTTFFTT FTFTFTFT ~p ⋀ ~q FFFTFFFT It is true only when ~p and~q are true.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. 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

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 9: Determine the Truth Value of a Compound Statement 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 ⋁ qp ⋁ q F ⋁ F F Solution

Copyright 2013, 2010, 2007, Pearson, Education, Inc. 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

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 9: Determine the Truth Value of a Compound Statement 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. Solution

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 9: Determine the Truth Value of a Compound Statement 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. Solution

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Example 9: Determine the Truth Value of a Compound Statement 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. Solution

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Try This: P. 117 #

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Homework P. 115 # 6-60 (x3)