Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13

Slides:



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

Valid arguments A valid argument has the following property:
Introduction to Proofs
1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.
Common logical forms Study the following four arguments.
Semantics of SL and Review Part 1: What you need to know for test 2 Part 2: The structure of definitions of truth functional notions Part 3: Rules when.
Euler’s circles Some A are not B. All B are C. Some A are not C. Algorithm = a method of solution guaranteed to give the right answer.
Use a truth table to determine the validity or invalidity of this argument. First, translate into standard form “Martin is not buying a new car, since.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
1 Discrete Structures CS Johnnie Baker Comments on Early Term Test.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Through the Looking Glass, 1865
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Adapted from Discrete Math
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
Copyright © Curt Hill Rules of Inference What is a valid argument?
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.
Valid and Invalid Arguments
Section 3.5 Symbolic Arguments
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
Verifying Arguments MATH 102 Contemporary Math S. Rook.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Discrete Structures (DS)
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
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.
Thinking Mathematically Arguments and Truth Tables.
Methods of Proof for Boolean Logic Chapter 5 Language, Proof and 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.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Copyright © Cengage Learning. All rights reserved.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Methods of Proof – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Methods of Proof Reading: Kolman, Section 2.3.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems.
Chapter 1 Logic and proofs
Discrete Mathematical
2. The Logic of Compound Statements Summary
Valid and Invalid Arguments
Truth Tables and Equivalent Statements
Introduction to Logic Lecture 14 The truth functional argument
Common logical forms Study the following four arguments.
Evaluating truth tables
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
The Foundations: Logic and Proofs
Argument Lecture 5.
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Discrete Mathematics Lecture # 8.
Thinking Critically Copyright © 2011 Pearson Education, Inc.
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 4 Logic of Quantified Statements
Foundations of Discrete Mathematics
Section 3.3 Truth Tables for the Conditional and Biconditional
6.4 Truth Tables for Arguments
Valid and Invalid Arguments
1.3 Propositional Equivalences
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Philosophical Methods
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
3.5 Symbolic Arguments.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Presentation transcript:

Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13 The Converse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13

Converse Error Also known as the fallacy of affirming the consequent (Epp p. 58). The converse error is a reasoning error that can be easily made, since in at least one case the conclusion can be true given the premises, but not in all cases. The premises present a given implication, and then state that the result of the implication or the consequent is true. This step is called affirming the consequent. The conclusion then states that since the consequent is true, the antecedent must be true. Although at first glance the argument looks valid, but can be soon shown invalid by using truth tables, or by counterexample. We see an example of this error in exercise #28 in section 2.3 of our Discrete Mathematics and Applications textbook. We can see the problem on the next slide.

Section 2.3 #28 Use symbols to write the logical form of each argument. If the argument is valid, identify the rule of inference that guarantees its validity. Otherwise, state whether the converse or the inverse error is made. 28. Premise #1: If there are as many rational numbers as there are irrational numbers, then the set of all irrational numbers is infinite. Premise #2: The set of all irrational numbers is infinite ∴There are as many rational numbers as there are irrational numbers. Solution: Symbolically the initial implication (Premise #1) is of the basic form If P, then Q, or P→Q, letting P = There are as many rational numbers as there are irrational numbers. Q = The set of all irrational numbers is infinite. Premise #2 states that Q is true The conclusion states that P is true The simple answer is that the argument is invalid, because the converse error is made. But lets look at truth table to prove this answer.

Looking at the truth table below, we identify our premises Looking at the truth table below, we identify our premises. We look for instances when both our premises P → Q and Q are true. In the first row, our premises are true and our conclusion P is true. But in the third row we see that even though P → Q and Q are true, P is not true. P Q P → Q T F F* *P → Q is only false when P is true, and Q is false. This means that Q could be true for some other reason unrelated to P, which is important to our solution. To state this as a counterexample, given the original implication “If there as many rational numbers as there are irrational numbers, then the set of all irrational numbers is infinite.” The set of irrational numbers can be infinite, but could be considered infinite for reasons not pertaining to the amount of rational numbers at all. This argument WOULD be true if it was stated as: “The set of irrational numbers is infinite if and only if there are as many rational numbers as there are irrational numbers.” Otherwise, the conclusion is false, and the argument is invalid due to the converse error.