1. Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved

2. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-2 Chapter 3: Introduction to Logic 3.1 Statements and Quantifiers 3.2 Truth Tables and Equivalent Statements 3.3 The Conditional and Circuits 3.4 More on the Conditional 3.5Analyzing Arguments with Euler Diagrams 3.6Analyzing Arguments with Truth Tables

3. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-3 Chapter 1 Section 3-3 The Conditional and Circuits

4. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-4 The Conditional and Circuits Conditionals Negation of a Conditional Circuits

5. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-5 Conditionals A conditional statement is a compound statement that uses the connective if…then. The conditional is written with an arrow, so “if p then q” is symbolized We read the above as “p implies q” or “if p then q.” The statement p is the antecedent, while q is the consequent.

6. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-6 Truth Table for The Conditional, If p, then q p q T TT T FF F TT F FT If p, then q

7. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-7 Special Characteristics of Conditional Statements 1. is false only when the antecedent is true and the consequent is false. 2. If the antecedent is false, then is automatically true. 3. If the consequent is true, then is automatically true.

8. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-8 Example: Determining Whether a Conditional Is True or False Decide whether each statement is True or False (T represents a true statement, F a false statement). Solution a) False b) True

9. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-9 Tautology A statement that is always true, no matter what the truth values of the components, is called a tautology. They may be checked by forming truth tables.

10. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-10 Negation of a Conditional The negation of

11. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-11 Writing a Conditional as an “or” Statement

12. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-12 Example: Determining Negations Determine the negation of each statement. a) If you ask him, he will come. b) All dogs love bones. Solution a) You ask him and he will not come. b) It is a dog and it does not love bones.

13. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-13 Circuits Logic can be used to design electrical circuits. pq Series circuit p q Parallel circuit

14. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-14 Equivalent Statements Used to Simplify Circuits

15. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-15 Equivalent Statements Used to Simplify Circuits If T represents any true statement and F represents any false statement, then

16. © 2008 Pearson Addison-Wesley. All rights reserved 3-3-16 Example: Drawing a Circuit for a Conditional Statement Draw a circuit for ~ p q Solution ~ r