Presentation is loading. Please wait.

Presentation is loading. Please wait.

© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional.

Similar presentations


Presentation on theme: "© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional."— Presentation transcript:

1 © 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional

2 © 2010 Pearson Prentice Hall. All rights reserved. Learning Targets 1.Understand the logic behind the definition of the conditional. 2.Construct truth tables for conditional statements. 3.Understand the definition of the biconditional. 4.Construct truth tables for biconditional statements. 5.Determine the true value of a compound statement for a specific case. 2

3 © 2010 Pearson Prentice Hall. All rights reserved. Truth Tables for Conditional Statements p  q antecedent  consequent If p then q. A conditional is false only when the antecedent is true and the consequent is false. Conditional p q p  q T T T FF F TT F T 3

4 © 2010 Pearson Prentice Hall. All rights reserved. Example 1: Constructing a Truth Table Construct a truth table for ~q  ~p p q~q~q~p~p ~q  ~p T FFT T FTFF F TFTT F TTT 4

5 © 2010 Pearson Prentice Hall. All rights reserved. More on the Conditional Statement You can reverse and negate the antecedent and consequent, and the statement’s truth value will not change. –If you’re cool, you won’t wear clothing with your school name on it. –If you wear clothing with your school name on it, you’re not cool. 5

6 © 2010 Pearson Prentice Hall. All rights reserved. Example 2: Constructing a Truth Table Construct a truth table for [( p  q)  ~ p]  q p q p  qp  q ~p~p (p  q)  ~p[( p  q)  ~p]  q T T F F T F 6

7 © 2010 Pearson Prentice Hall. All rights reserved. Example 2: Constructing a Truth Table Construct a truth table for [( p  q)  ~ p]  q p q p  qp  q ~p~p (p  q)  ~p[( p  q)  ~p]  q T TFFT T FTFFT F TTTTT F FTFT 7

8 © 2010 Pearson Prentice Hall. All rights reserved. Biconditional Statements p  q p if and only if q: p  q and q  p True only when the component statements have the same value. Truth table for the Biconditional p q p  q T T T FF F TF F T 8

9 © 2010 Pearson Prentice Hall. All rights reserved. Definitions of Symbolic Logic 9

10 © 2010 Pearson Prentice Hall. All rights reserved. Example 5: Determining the Truth Value of a Compound Statement You receive a letter that states that you have been assigned a Super Million Dollar Prize Entry Number - - 665567010. If your number matches the winning pre-selected number and you return the number before the deadline, you will win $1,000,000.00. Suppose that your number does not match the winning pre-selected number, you return the number before the deadline and only win a free issue of a magazine. Under these conditions, can you sue the credit card company for making a false claim? 10

11 © 2010 Pearson Prentice Hall. All rights reserved. Example 5 continued Solution: Assign letters to the simple statements in the claim. 11

12 © 2010 Pearson Prentice Hall. All rights reserved. Example 5 continued Now write the underlined claim in the letter in symbolic form: 12

13 © 2010 Pearson Prentice Hall. All rights reserved. Example 5 continued Substitute the truth values for p, q, and r to determine the truth value for the letter’s claim. (p  q)  r (F  T)  F F  F T Our truth-value analysis indicates that you cannot sue the credit card company for making a false claim. 13

14 © 2010 Pearson Prentice Hall. All rights reserved. HOMEWORK Pg 146 – 147, #2 – 12(e), 22 – 30 (e), 34 – 48(e), 58, 60.


Download ppt "© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional."

Similar presentations


Ads by Google