Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Slides:



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

3 Logic The Study of What’s True or False or Somewhere in Between.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Statements and Quantifiers
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. 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.
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.
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.
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Slide Copyright © 2009 Pearson Education, Inc. 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.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional.
Thinking Mathematically
COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.
Chapter 1: The Foundations: Logic and Proofs
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
 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.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
 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.
 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.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Introduction to Deductive Proofs
2. The Logic of Compound Statements Summary
AND.
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
Truth Tables and Equivalent Statements
Chapter 3: Introduction to Logic
The Conditional And Circuits
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
Propositional Equivalences
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 © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 1 Logic and Proof.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
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 Logic.
Section 3.3 Truth Tables for the Conditional and Biconditional
Truth Tables for the Conditional and Biconditional
Statements and Logical Connectives
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CHAPTER 3 Logic.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Conditional and Biconditional Statements
Presentation transcript:

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

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 2012 Pearson Education, Inc.

The Conditional and Circuits Section 3-3 The Conditional and Circuits 2012 Pearson Education, Inc.

The Conditional and Circuits Conditionals Negation of a Conditional Circuits 2012 Pearson Education, Inc.

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. 2012 Pearson Education, Inc.

Truth Table for The Conditional, If p, then q p q T T T T F F F T F F 2012 Pearson Education, Inc.

Special Characteristics of Conditional Statements is false only when the antecedent is true and the consequent is false. If the antecedent is false, then is automatically true. If the consequent is true, then is automatically true. 2012 Pearson Education, Inc.

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 2012 Pearson Education, Inc.

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. 2012 Pearson Education, Inc.

Negation of a Conditional The negation of 2012 Pearson Education, Inc.

Writing a Conditional as an “or” Statement 2012 Pearson Education, Inc.

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. 2012 Pearson Education, Inc.

Circuits Logic can be used to design electrical circuits. p q p q Series circuit Parallel circuit 2012 Pearson Education, Inc.

Equivalent Statements Used to Simplify Circuits 2012 Pearson Education, Inc.

Equivalent Statements Used to Simplify Circuits If T represents any true statement and F represents any false statement, then 2012 Pearson Education, Inc.

Example: Drawing a Circuit for a Conditional Statement Draw a circuit for Solution ~ p q ~ r 2012 Pearson Education, Inc.