© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
Advertisements

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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
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.
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.
Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001.
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.
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.2 Truth Tables.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
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)
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
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.
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?
Review Given p: Today is Thursday q: Tomorrow is Friday
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Thinking Mathematically
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
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,
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.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
3.3 – The Conditional A conditional statement is a compound statement that uses the connective if…then. The conditional is written with an arrow, so “if.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
 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
 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.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Truth Tables, Continued 6.3 and 6.4 March 14th. 6.3 Truth tables for propositions Remember: a truth table gives the truth value of a compound proposition.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
1-4 Solving Inequalities
AND.
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
How do I show that two compound propositions are logically equivalent?
Truth Tables for Negation, Conjunction, and Disjunction
3.5 Symbolic Arguments.
TRUTH TABLES.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Statements of Symbolic Logic
Algebra 1 Section 4.5.
And represent them using Venn Diagrams.
Foundations of Discrete Mathematics
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.
3.5 Symbolic Arguments.
Presentation transcript:

© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction

© 2010 Pearson Prentice Hall. All rights reserved. Learning Targets: 1.Use the definitions of negation, conjunction, and disjunction. 2.Construct truth tables. 3.Determine the truth value of a compound statement for a specific case. 2

© 2010 Pearson Prentice Hall. All rights reserved. Truth Tables Negation (not): Opposite truth value from the statement. Negation p~p TF FT 3

© 2010 Pearson Prentice Hall. All rights reserved. Truth Tables Conjunction (and): Only true when both statements are true. Conjunction p q p  q T T T FF F TF F F 4

© 2010 Pearson Prentice Hall. All rights reserved. Truth Tables Disjunction (or): Only false when both statements are false. Disjunction p q p  q T T T FT F TT F F 5

© 2010 Pearson Prentice Hall. All rights reserved. Example 1: Using the Definitions of Negation, Conjunction, and Disjunction Let p and q represent the following statements: p: 10 > 4 q: 3 < 5 Determine the truth value for each statement: a.p  qa.p  q Since both are true, the conjunction is true. b. ~ p  q Since p is true, ~p is false, so the conjunction is false. 6

© 2010 Pearson Prentice Hall. All rights reserved. Example 1 continued Let p and q represent the following statements: p: 10 > 4 q: 3 < 5 Determine the truth value for each statement: c.p  qc.p  q Since both are true and a disjunction is only false when both components are false, this is true. d. ~p  ~q Since q is true, ~q is false. So, the disjunction is false. 7

© 2010 Pearson Prentice Hall. All rights reserved. Example 2: Constructing Truth Tables Construct a truth table for ~(p  q) Step 1: First list the simple statements on top and show all the possible truth values. Step 2: Make a column for p  q and fill in the truth values. p q p  q T T T F F F T F F F 8

© 2010 Pearson Prentice Hall. All rights reserved. Example 2 continued Step 3: Construct one more column for ~(p  q). The final column tells us that the statement is false only when both p and q are true. For example: p: Harvard is a college. (true) q: Yale is a college. (true) ~(p  q): It is not true that Harvard and Yale are colleges. A compound statement that is always true is called a tautology. Is this a tautology? NO p q p  q~(p  q) T TF T FFT F TFT F FT 9

© 2010 Pearson Prentice Hall. All rights reserved. Example 3: Constructing a Truth Table Construct a truth table for (~p  q)  ~q. p q~p~p ~p  q~p  q ~q~q (~p  q)  ~q T FTFF T FFFTF F TTTFF F TTTT 10

© 2010 Pearson Prentice Hall. All rights reserved. Constructing a Truth Table with Eight Cases There are eight different true-false combinations for compound statements consisting of three simple statements. 11

© 2010 Pearson Prentice Hall. All rights reserved. Example 6: Constructing a Truth Table with Eight Cases Construct a truth table for the following statement: a. I study hard and ace the final, or I fail the course. b.Suppose that you study hard, you do not ace the final and you fail the course. Under these conditions, is this compound statement true or false? Solution: We represent our statements as follows: p: I study hard. q: I ace the final. r: I fail the course. 12

© 2010 Pearson Prentice Hall. All rights reserved. Example 6 continued Writing the given statement in symbolic form: The completed table is: The statement is True. 13

© 2010 Pearson Prentice Hall. All rights reserved. Determining Truth Values for Specific Cases We can determine the truth value of a compound statement for a specific case in which the truth values of the simple statements are known, without constructing an entire truth table. Substitute the truth values of the simple statements into the symbolic form of the compound statement and use the appropriate definitions to determine the truth value of the compound statement. 14

© 2010 Pearson Prentice Hall. All rights reserved. Example 7: Determining the Truth Value of a Compound Statement 15

© 2010 Pearson Prentice Hall. All rights reserved. Example 7: Determining the Truth Value of a Compound Statement Use the information in the circle graphs to determine the truth value of the following statement: It is not true that freshmen make up 24% of the undergraduate college population and account for more than one-third of the undergraduate deaths, or seniors do not account for 30% of the undergraduate deaths. 16

© 2010 Pearson Prentice Hall. All rights reserved. Example 7 continued 17

© 2010 Pearson Prentice Hall. All rights reserved. Example 7 continued Substitute the truth values for p, q, and r that we obtained from the circle graphs to determine the truth value. ~(p  q)  ~r This is the given compound statement in symbolic form. ~(T  T)  ~F Substitute the truth value obtained from the graph. ~T  ~F Replace T  T with T. Conjunction is true when both parts are true. F  T Replace ~T with F and ~F with T. Negation gives the opposite truth value. T Replace F  T with T. Disjunction is true when at least one part is true. We conclude that the given statement is true. 18

© 2010 Pearson Prentice Hall. All rights reserved. HOMEWORK: Pg 135, #2 – 38 (e), 44, 46, 48