Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

Slides:



Advertisements
Similar presentations
3.4 More on the Conditional
Advertisements

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Notes on Logic Continued
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Conditional Statements
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Adapted from Discrete Math
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
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.
Propositions and Truth Tables
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 1: The Foundations: Logic and Proofs
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
Related Conditional Statements 2-1B What are the three related conditional statements? How are the three related conditional statements made?
© 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.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
Unit 01 – Lesson 07 – Conditional Statements
Thinking Mathematically
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.4, Slide 1 3 Logic The Study of What’s True or False or Somewhere in Between 3.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Lesson 2-1 Conditional Statements 1 Lesson 2-3 Conditional Statements.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Simple Logic.
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
Presented by: Tutorial Services The Math Center
2. The Logic of Compound Statements Summary
AND.
Truth Tables and Equivalent Statements
Chapter 3: Introduction to Logic
Conditional Statements
Logic.
(CSC 102) Discrete Structures Lecture 2.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
The Foundations: Logic and Proofs
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
2 Chapter Introduction to Logic and Sets
Conditional Statements
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 20 Hash Tables.
(1.4) An Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
Opening hexagon A _____________________ has six sides.
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Statements of Symbolic Logic
Section 3.7 Switching Circuits
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CHAPTER 3 Logic.
Logic and Reasoning.
Conditional Statements Section 2.3 GEOMETRY
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Presentation transcript:

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

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.5 Analyzing Arguments with Euler Diagrams 3.6 Analyzing Arguments with Truth Tables © 2008 Pearson Addison-Wesley. All rights reserved

Section 3-4 Chapter 1 More on the Conditional © 2008 Pearson Addison-Wesley. All rights reserved

More on the Conditional Converse, Inverse, and Contrapositive Alternative Forms of “If p, then q” Biconditionals Summary of Truth Tables © 2008 Pearson Addison-Wesley. All rights reserved

Converse, Inverse, and Contrapositive Conditional Statement If p, then q Converse If q, then p Inverse If not p, then not q Contrapositive If not q, then not p © 2008 Pearson Addison-Wesley. All rights reserved

Example: Determining Related Conditional Statements Given the conditional statement If I live in Wisconsin, then I shovel snow, determine each of the following: a) the converse b) the inverse c) the contrapositive Solution a) If I shovel snow, then I live in Wisconsin. b) If I don’t live in Wisconsin, then I don’t shovel snow. c) If I don’t shovel snow, then I don’t live in Wisconsin. © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Equivalences A conditional statement and its contrapositive are equivalent, and the converse and inverse are equivalent. © 2008 Pearson Addison-Wesley. All rights reserved

Alternative Forms of “If p, then q” The conditional can be translated in any of the following ways. If p, then q. p is sufficient for q. If p, q. q is necessary for p. p implies q. All p are q. p only if q. q if p. © 2008 Pearson Addison-Wesley. All rights reserved

Example: Rewording Conditional Statements Write each statement in the form “if p, then q.” a) You’ll be sorry if I go. b) Today is Sunday only if yesterday was Saturday. c) All Chemists wear lab coats. Solution a) If I go, then you’ll be sorry. b) If today is Sunday, then yesterday was Saturday. c) If you are a Chemist, then you wear a lab coat. © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Biconditionals The compound statement p if and only if q (often abbreviated p iff q) is called a biconditional. It is symbolized , and is interpreted as the conjunction of the two conditionals © 2008 Pearson Addison-Wesley. All rights reserved

Truth Table for the Biconditional p if and only if q p q T T T T F F F T F F © 2008 Pearson Addison-Wesley. All rights reserved

Example: Determining Whether Biconditionals are True or False Determine whether each biconditional statement is true or false. a) 5 + 2 = 7 if and only if 3 + 2 = 5. b) 3 = 7 if and only if 4 = 3 + 1. c) 7 + 6 = 12 if and only if 9 + 7 = 11. Solution a) True (both component statements are true) b) False (one component is true, one false) c) True (both component statements are false) © 2008 Pearson Addison-Wesley. All rights reserved

Summary of Truth Tables 1. The negation of a statement has truth value opposite of the statement. The conjunction is true only when both statements are true. The disjunction is false only when both statements are false. The biconditional is true only when both statements have the same truth value. © 2008 Pearson Addison-Wesley. All rights reserved