Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

Slides:



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

Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
The Foundations: Logic and Proofs
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Statements and Quantifiers
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.4 Equivalent Statements.
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.
3.6 Analyzing Arguments with Truth Tables
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 10 Logic Section 10.1 Statements Section 10.2 Conditional Statements Section.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Section 3.5 Symbolic Arguments
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Verifying Arguments MATH 102 Contemporary Math S. Rook.
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.
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 Arguments and Truth Tables.
Aim: Invalid Arguments Course: Math Literacy Do Now: Aim: What’s an Invalid Argument? Construct a truth table to show the following argument is not valid.
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Rules of Inference Section 1.6. Arguments in Propositional Logic A argument in propositional logic is a sequence of propositions. All but the final proposition.
Chapter 2 Review Conditional Statements Laws of 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.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Introduction to Logic © 2008 Pearson Addison-Wesley.
CSE15 Discrete Mathematics 01/30/17
Truth Tables and Equivalent Statements
Chapter 3: Introduction to Logic
Chapter 3 Logic Active Learning Lecture Slides
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
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
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
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
Section 3.6 Euler Diagrams and Syllogistic Arguments
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CHAPTER 3 Logic.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CHAPTER 3 Logic.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
3.5 Symbolic Arguments.
CHAPTER 3 Logic.
Presentation transcript:

Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND

Copyright © 2009 Pearson Education, Inc. Chapter 3 Section 5 - Slide 2 Chapter 3 Logic

Copyright © 2009 Pearson Education, Inc. Chapter 3 Section 5 - Slide 3 WHAT YOU WILL LEARN Symbolic arguments and standard forms of arguments Euler diagrams and syllogistic arguments

Copyright © 2009 Pearson Education, Inc. Chapter 3 Section 5 - Slide 4 Section 5 Symbolic Arguments

Chapter 3 Section 5 - Slide 5 Copyright © 2009 Pearson Education, Inc. Symbolic Arguments An argument is valid when its conclusion necessarily follows from a given set of premises. An argument is invalid (or a fallacy) when the conclusion does not necessarily follow from the given set of premises.

Chapter 3 Section 5 - Slide 6 Copyright © 2009 Pearson Education, Inc. Law of Detachment Also called modus ponens. The argument form symbolically written: Premise 1: Premise 2: Conclusion: If [ premise 1 and premise 2 ] then conclusion [ (p  q)  p ]  q

Chapter 3 Section 5 - Slide 7 Copyright © 2009 Pearson Education, Inc. Determine Whether an Argument is Valid Write the argument in symbolic form. Compare the form with forms that are known to be either valid or invalid. If the argument contains two premises, write a conditional statement of the form [(premise 1)  (premise 2)]  conclusion Construct a truth table for the statement above. If the answer column of the table has all trues, the statement is a tautology, and the argument is valid. If the answer column of the table does not have all trues, the argument is invalid.

Chapter 3 Section 5 - Slide 8 Copyright © 2009 Pearson Education, Inc. Example: Determining Validity with a Truth Table Determine whether the following argument is valid or invalid. If you score 90% on the final exam, then you will get an A for the course. You will not get an A for the course.   You do not score 90% on the final exam.

Chapter 3 Section 5 - Slide 9 Copyright © 2009 Pearson Education, Inc. Example: Determining Validity with a Truth Table (continued) Construct a truth table. In symbolic form the argument is: Solution: Let p: You score 90% on the final exam. q: You will get an A in the course. p  q~q~pp  q~q~p

Chapter 3 Section 5 - Slide 10 Copyright © 2009 Pearson Education, Inc. Example: Determining Validity with a Truth Table (continued) pq[(p  q)  ~ q]  ~p~p TTFFTTFF TFTFTFTF F F T T T F T T F F F T F T F T Fill-in the table in order, as follows: Since column 5 has all T’s, the argument is valid T T T T 5

Chapter 3 Section 5 - Slide 11 Copyright © 2009 Pearson Education, Inc. Valid Arguments Law of Detachment Law of Syllogism Law of Contraposition Disjunctive Syllogism

Chapter 3 Section 5 - Slide 12 Copyright © 2009 Pearson Education, Inc. Invalid Arguments Fallacy of the Converse Fallacy of the Inverse

Chapter 3 Section 5 - Slide 13 Copyright © 2009 Pearson Education, Inc. Translate the following argument into symbolic form. Determine whether the argument is valid or invalid. If Jenny gets some rest, then she will feel better. If Jenny feels better, then she will help me paint my bedroom. Therefore, if my bedroom is painted, then Jenny must have gotten some rest.

Chapter 3 Section 5 - Slide 14 Copyright © 2009 Pearson Education, Inc. Translate the following argument into symbolic form. Determine whether the argument is valid or invalid. If Jenny gets some rest, then she will feel better. If Jenny feels better, then she will help me paint my bedroom. Therefore, if my bedroom is painted, then Jenny must have gotten some rest.

Copyright © 2009 Pearson Education, Inc. Chapter 3 Section 5 - Slide 15 Section 6 Euler Diagrams and Syllogistic Arguments

Chapter 3 Section 5 - Slide 16 Copyright © 2009 Pearson Education, Inc. Syllogistic Arguments Another form of argument is called a syllogistic argument, better known as syllogism. The validity of a syllogistic argument is determined by using Euler (pronounced “oiler”) diagrams.

Chapter 3 Section 5 - Slide 17 Copyright © 2009 Pearson Education, Inc. Euler Diagrams One method used to determine whether an argument is valid or is a fallacy. Uses circles to represent sets in syllogistic arguments.

Chapter 3 Section 5 - Slide 18 Copyright © 2009 Pearson Education, Inc. Symbolic Arguments Versus Syllogistic Arguments Euler diagramsall are, some are, none are, some are not Syllogistic argument Truth tables or by comparison with standard forms of arguments and, or, not, if-then, if and only if Symbolic argument Methods of determining validity Words or phrases used

Chapter 3 Section 5 - Slide 19 Copyright © 2009 Pearson Education, Inc. Example: Ballerinas and Athletes Determine whether the following syllogism is valid or invalid. All ballerinas are athletic. Keyshawn is athletic.  Keyshawn is a ballerina.

Chapter 3 Section 5 - Slide 20 Copyright © 2009 Pearson Education, Inc. Example: Ballerinas and Athletes Keyshawn is athletic, so must be placed in the set of athletic people, which is A. We have a choice, as shown above. All ballerinas, B, are athletic, A. A B U The conclusion does not necessarily follow from the set of premises. The argument is invalid. A B U A B U Let A = all Athletes and B = all Ballerinas. Let K represent Keyshawn.

Chapter 3 Section 5 - Slide 21 Copyright © 2009 Pearson Education, Inc. Determine whether the syllogism is valid or is a fallacy. a.Valid b.Fallacy c.Can’t determine Some teachers teach math. Some teachers teach English. Therefore, some teachers teach math and English.

Chapter 3 Section 5 - Slide 22 Copyright © 2009 Pearson Education, Inc. Determine whether the syllogism is valid or is a fallacy. a.Valid b.Fallacy c.Can’t determine Some teachers teach math. Some teachers teach English. Therefore, some teachers teach math and English.