HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.2 Truth Tables.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

TRUTH TABLES Section 1.3.
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
Truth Tables Presented by: Tutorial Services The Math Center.
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
Introduction to Symbolic Logic
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 3 Syntax of Propositional Logic Parse trees revised Construction of parse trees Semantics of propositional.
Boolean Algebra Computer Science AND (today is Monday) AND (it is raining) (today is Monday) AND (it is not raining) (today is Friday) AND (it is.
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
Through the Looking Glass, 1865
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Logic Truth Tables, Propositions, Implications. Statements Logic is the tool for reasoning about the truth or falsity of statements. –Propositional logic.
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
Logic ChAPTER 3.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Chapter 3 – Introduction to Logic The initial motivation for the study of logic was to learn to distinguish good arguments from bad arguments. Logic is.
Validity: Long and short truth tables Sign In! Week 10! Homework Due Review: MP,MT,CA Validity: Long truth tables Short truth table method Evaluations!
Lecture 8 Introduction to Logic CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
The Foundations: Logic and Proofs
Intro to Discrete Structures
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.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.1 Logic Statements.
Truth Tables and Validity Kareem Khalifa Department of Philosophy Middlebury College pqrSp v qr & s~(p v q)~p~q~p & ~q~(p v q) -> (r & s) (~p & ~q) ->
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.
Boolean Algebra. Logical Statements A proposition that may or may not be true:  Today is Monday  Today is Sunday  It is raining.
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.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
How do I show that two compound propositions are logically equivalent?
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.
LOGIC.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Logical Form and Logical Equivalence M Logical Form Example 1 If the syntax is faulty or execution results in division by zero, then the program.
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.
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,
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
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.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Welcome to Interactive Chalkboard Glencoe Geometry Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Developed by FSCreations, Inc.,
Assign Yourself and Do Now Thursday, January 10, 2013.
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
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.
Boolean logic Taken from notes by Dr. Neil Moore
TRUTH TABLES.
Boolean logic Taken from notes by Dr. Neil Moore
Presentation transcript:

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.2 Truth Tables

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Objectives o Construct truth tables

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Truth Tables It can often get quite complicated to keep up with the truth values for compound statements, especially when they have more and more pieces to them. To help us determine the truth value of more complex compound statements, we can use a truth table. A truth table is a table used to orderly and systematically determine the truth value for compound statements.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Truth Table A truth table is a table that has a row for each possible combination of truth values of the individual statements that make up the compound statement.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Conjunction If a and b are statements, then “a and b” is a compound statement called a conjunction. A conjunction is true only when both statements are true; otherwise it is false. Truth Table for a Conjunction ad a ∧ da ∧ d TTT TFF FTF FFF

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Disjunction If a and b are statements, then “a or b” is a compound statement called a disjunction. A disjunction will always be true unless both statements are false. Truth Table for a Disjunction cd c ∨ d TTT TFT FTT FFF

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Conditional If a and b are statements, then “if a, then b” is a compound statement called a conditional. A conditional will always be true unless a is true and b is false.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 1: Constructing a Truth Table for a Conditional Statement Consider the conditional statement If it rains, then we will stay home tonight. Let the following statements represent w and z. w:It rains. z:We will stay home tonight. Construct the truth table for w ⇒ z. Solution Begin by making a column for each simple statement w and z and filling in all possible truth combinations.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 1: Constructing a Truth Table for a Conditional Statement (cont.) Truth Table for a Conditional wz TT TF FT FF The last column will contain the conditional w ⇒ z. Recall that the “promise” is only broken when the first part is true and the second part is false. Therefore, the truth values for the conditional are as follows.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 1: Constructing a Truth Table for a Conditional Statement (cont.) Truth Table for a Conditional wz w ⇒ zw ⇒ z TTT TFF FTT FFT

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 2: Constructing a Truth Table for a Disjunction Construct the truth table for the following compound statement: a ∨ ∼ b. Solution First, we need to decide on the beginning pieces for the table. We certainly need columns for the simple statements a and b. Before adding the column for the disjunction, we need a column for the negation of b as well. Begin by completing the first two columns of the table so that we have all four possible combinations of truth values for a and b.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 2: Constructing a Truth Table for a Disjunction (cont.) Notice that the last column is the compound statement we were given. Truth Table ab ∼b∼ba ∨ ∼ b TT TF FT FF

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 2: Constructing a Truth Table for a Disjunction (cont.) Filling in the negation of b column, we have the following. Remember that the negation has the opposite truth value of the original statement. Truth Table ab ∼b∼ba ∨ ∼ b TTF TFT FTF FFT

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 2: Constructing a Truth Table for a Disjunction (cont.) Finally, we need to fill in the column for the disjunction. Remember that the disjunction is true unless both pieces are false. Comparing the 1 st and 3 rd columns, we can fill in the remainder of the truth table. Truth Table ab ∼b∼ba ∨ ∼ b TTFT TFTT FTFF FFTT

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Summary of Logic Statements NotationReadTruth Value Rule Negation ∼p∼p not popposite of truth value of p Conjunction p ∧ qp ∧ q p and qtrue only when both p and q are true Disjunction p ∨ q p or qfalse only when both p and q are false Conditional p ⇒ q if p, then qfalse only when p is true and q is false

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 3: Constructing a Truth Table from Words Construct the truth table for the following compound statement. If you’re not making mistakes, then you’re not doing anything.—John Wooden, member of the Basketball Hall of Fame, both as a player and a coach. Solution This statement might seem rather easy to write down at first glance, but we will take a moment to list the simple statements without using the negations. Let statements a and b be the following.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 3: Constructing a Truth Table from Words (cont.) a: You are making mistakes. b: You are doing something. So, our conditional statement is If you are not making mistakes, then you are not doing anything: ∼ a ⇒ ∼ b. A conditional statement is false only when the if part is true and the then part is false. The truth table will look like the following.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 3: Constructing a Truth Table from Words (cont.) Truth Table “If ” ↓ “Then ” ↓ ab ∼a∼a ∼b∼b ∼ a ⇒ ∼ b TTFFT TFFTT FTTFF FFTTT From the truth table, we can see that the compound statement is true in all but one of the cases; the statement is false when you are not making mistakes and you are doing something.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Skill Check #1 Construct a truth table for the conditional statement in Example 3. Let statements a and b be the following. a: You're not making mistakes b: You're not doing anything Does your truth table have the same truth values as the table in Example 3? Should it?

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Skill Check #1 Answer: No, the truth tables do not look exactly the same. The truth tables have the same meaning, but do not look identical since a and b are defined differently. Truth Table ab a ⇒ ba ⇒ b TTT TFF FTT FFT

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Tautology A tautology is a statement that is true in all possible circumstances.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 4: Constructing a Truth Table for a Tautology Construct the truth table for the following compound statement. Next year, Imre can take physics or he cannot take physics. Solution Let c represent “Imre can take physics next year.” Then statement c is the first part of the compound statement.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 4: Constructing a Truth Table for a Tautology (cont.) To express the entire statement, we need to symbolize the part after the or in the statement—“Imre cannot take physics next year.” Notice that this is simply the negation of c. So, our entire compound statement can then be expressed by c ∨  c. The truth table is then represented by the following.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 4: Constructing a Truth Table for a Tautology (cont.) Hence, “Next year, Imre can take physics or he cannot take physics” is a tautology, since all truth values for the disjunction in the last column are true. Truth Table c cc c ∨ ∼ c TFT FTT

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement Consider the following response opinion on immigrant fishermen being jailed in Davidson County printed in The Tennessean. If they come here illegally then commit more offenses while they are here, no matter how small... they will eventually commit greater offenses. Construct the truth table for the statement given in the newspaper.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) Solution As we said before, English is a rich and complicated language. We need to be careful with simply seeing the words “if..., then” without looking at the intent behind the statement. In the original quotation from the newspaper, the words “if..., then” appear, but are not used in the same mathematical way we have been talking about.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) Also, the word and was implied, but not written. Here’s a rewording of the actual quotation using the logical “if a, then b” compound statement. If they come here illegally and they commit more offenses while they are here, no matter how small, then they will eventually commit greater offenses. Let’s break down this compound statement and write out its truth table.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) Let p, q, and r represent the following simple statements. p:They come here illegally. q:They commit more offenses while they are here, no matter how small. r:They will eventually commit greater offenses.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) That gives us the following mathematical statement. (p ∧ q) ⇒ r: If they come here illegally and commit more offenses while they are here, no matter how small, then they will eventually commit greater offenses. When we build the truth table, we need to include all the parts that will eventually build up our final conditional statement. Remember to include enough rows for three simple statements, that is, 2 ⋅ 2 ⋅ 2 = 8.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) Truth Table pqr p ∧ qp ∧ q(p ∧ q ) ⇒ r TTT TTF TFT TFF FTT FTF FFT FFF The first part of the table should look as follows.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) We find it easier to list all of the simple statements of the compound statement in order, and then copy a column over again for clarity if needed. In the next table, we’ve duplicated the column for r after the p ∧ q column for easy reference when completing the last column. Next, complete the column for the conjunction (that is, the and statement). Remember that a conjunction is true only if both of the individual statements are true.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) Truth Table pqr p ∧ qp ∧ q r (p ∧ q ) ⇒ r TTTTT TTFTF TFTFT TFFFF FTTFT FTFFF FFTFT FFFFF Finally, fill in the conditional column using the columns that contain the if and then parts.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) Truth Table “If ” ↓ “Then ” ↓ pqr p ∧ qp ∧ q r (p ∧ q ) ⇒ r TTTTTT TTFTFF TFTFTT TFFFFT FTTFTT FTFFFT FFTFTT FFFFFT

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) The truth table crystallizes what would need to be proven for this implication to be a true model for social policy. Since there is only one instance where the statement is false, the original speaker would have to prove that particular instance never happens in reality. In other words, one would have to show that illegal immigrants never commit more crimes without increasing their seriousness, or equivalently, illegal immigrants who continue to commit crimes always become more serious criminals.

HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Example 5: Constructing a Truth Table for a Conditional Statement (cont.) The quantifiers never and always in these sentences should make you hesitant to draw conclusions when they are used as part of a logical argument.