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.

Slides:



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

Valid arguments A valid argument has the following property:
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.
1 Valid and Invalid Arguments CS 202 Epp Section 1.3 Aaron Bloomfield.
CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Essential Deduction Techniques of Constructing Formal Expressions and Evaluating Attempts to Create Valid Arguments.
Essential Deduction Techniques of Constructing Formal Expressions Evaluating Attempts to Create Valid Arguments.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Through the Looking Glass, 1865
Introduction to Logic Logical Form: general rules
Copyright © 2005 Pearson Education, Inc. Slide 1-1.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Validity: Long and short truth tables Sign In! Week 10! Homework Due Review: MP,MT,CA Validity: Long truth tables Short truth table method Evaluations!
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
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.
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
Verifying Arguments MATH 102 Contemporary Math S. Rook.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Aim: Conditional, Converse & Inverse Course: Math Lit. Aim: What is a conditional statement? Its converse? Its inverse? Do Now: Construct a truth table.
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.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
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.
Thinking Mathematically Equivalent Statements, Conditional Statements, and De Morgan’s Laws.
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.
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?
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
If-then statements April 4, What is an if-then statement? One of the postulates we looked at earlier stated: If B is between A and C, then AB +
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.
Module Code MA0003NI: Computing mathematics Lecture for Week Autumn.
Chapter 1 Logic and proofs
Deductive Reasoning Valid Arguments
2. The Logic of Compound Statements Summary
CSE15 Discrete Mathematics 01/30/17
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Common logical forms Study the following four arguments.
Rules of Inference Section 1.6.
Chapter 8 Logic Topics
CS201: Data Structures and Discrete Mathematics I
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Applied Discrete Mathematics Week 1: Logic
TRUTH TABLES continued.
Discrete Mathematics Lecture # 8.
Thinking Critically Copyright © 2011 Pearson Education, Inc.
Discrete Mathematics Dr.-Ing. Erwin Sitompul
Premise: If it’s a school day, then I have Geometry class.
CHAPTER 3 Logic.
Valid and Invalid Arguments
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
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.
CHAPTER 3 Logic.
Presentation transcript:

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. If a person reads the Times, then she is well informed. This person is well informed. Therefore, this person reads the Times. An argument is called a valid argument if and only if its premises are true, thereby forcing the conclusion to be true.

Aim: Invalid Arguments Course: Math Literacy Do Now - 1st Invalid Argument pq T T F F T F T F p  qp  q T F T T T F T F T T F T (p  q) ˄ q [(p  q) ˄ q]  p Let p represent “A person reads the Times.” let q represent “This person is well informed.” p  q q  p Not true for all situations – invalid argument This person could be well informed w/o reading the Times. counterexample fallacy of converse or assuming the consequent

Aim: Invalid Arguments Course: Math Literacy Model Problem – 1 st Valid Argument Premises: If I oversleep, then I’ll be late for school. I am late for school. Conclusion: I overslept. Why is this an invalid argument? I could be late for other reasons. Let p: I oversleepq: I am late pq T T F F T F T F p  qp  q T F T T T F T F T T F T (p  q) ˄ q [(p  q) ˄ q]  p

Aim: Invalid Arguments Course: Math Literacy 1st Invalid Argument p  q q  p fallacy of converse or assuming the consequent Both premises ‘p  q’ and q must be true for conclusion to be true because of the conjunction T or F T What is truth of q? F  T is true p could be T or F T T or F T T  T is true p  q:

Aim: Invalid Arguments Course: Math Literacy Model Problem – 1 st Invalid Argument In an episode of the TV series “Star Trek”, the starship Enterprise is hit by an ion storm, causing the power to go out. Captain Kirk wonders if Mr. Scott, the engineer, is aware of the problem. Mr. Spock, the paragon of extraterrestrial intelligence, replies, “If Mr. Scott is still with us, the power should be on momentarily.” Moments later, the ship’s power comes on and Spock arches his Vulcan brow: “Ah, Mr. Scott is still with us.” Express Spock’s statements as an argument. If Mr. Scott is still with us, the power will come on. The power comes on. Therefore, Mr. Scott is still with us. valid or invalid?

Aim: Invalid Arguments Course: Math Literacy Model Problem – 1 st Invalid Argument If Mr. Scott is still with us, the power will come on. The power comes on. Therefore, Mr. Scott is still with us. p: Mr. Scott is still with us. q: Power will come on. 1.Use a letter to represent each simple statement in the argument. 2. Express the premises and the conclusion symbolically. p  q q  p Someone other than Scottie could have started the engines fallacy of converse or assuming the consequent

Aim: Invalid Arguments Course: Math Literacy 2 nd Invalid Argument p  q ~p  ~q This person could be well informed w/o reading the Times. If a person reads the Times, then he is well informed. This person does not read the Times. Therefore, this person is not well informed. fallacy of inverse or denying the antecedent Let p represent “A person reads the Times.” let q represent “This person is well informed.” If ‘p  q’ and ‘~p’, then ‘~q’. [(p  q) ˄ ~p]  ~q

Aim: Invalid Arguments Course: Math Literacy 2 nd Invalid Argument If a person reads the Times, then he is well informed. This person does not read the Times. Therefore, this person is not well informed. Let p represent “A person reads the Times.” let q represent “This person is well informed.” [(p  q) ˄ ~p]  ~q pq~p~q T T F F T F T F p  qp  q T F T T F F T T T T F T (p  q) ˄ ~p [(p  q) ˄ ~p]  ~q F F T T F T F T

Aim: Invalid Arguments Course: Math Literacy 2 nd Invalid Argument p  q ~p  ~q fallacy of inverse or denying the antecedent Both premises ‘p  q’ and ~p must be true for conclusion to be true because of the conjunction F ~F What is truth of q? F  T is true F  F is true ? q could be T or F ~q could be T or F T or F

Aim: Invalid Arguments Course: Math Literacy 2 nd Invalid Argument Example p  q: If x = 10, then x is greater than 5. ~p: x  10  ~q: x is not greater than 5 If x = 3, then it is T that ‘3 is not greater than 5’..... but If x = 8, then it is F that ‘8 is not greater than 5’.... consequently We cannot conclude that ~q, which means ‘x is not greater than 5’, is true. pq~p~q T T F F T F T F p  qp  q T F T T F F T T T T F T (p  q) ˄ ~p [(p  q) ˄ ~p]  ~q F F T T F T F T

Aim: Invalid Arguments Course: Math Literacy Model Problem – 2 nd Valid Argument If a person goes to college, he will make a lot of money. You don’t go to college. Therefore, you will not make a lot of money. Test the validity of the following Let p: person goes to college q: he will make a lot of money p  q ~p ~q p  q ~p  ~q fallacy of inverse or denying the antecedent You could win the lottery.

Aim: Invalid Arguments Course: Math Literacy Model Problem – 2 nd Invalid Argument If I study, I pass. I do not study. Therefore, I do not pass. Test the validity of the following Let p: I study q: I pass p  q ~p ~q~q p  q ~p  ~q Some people are just super smart! fallacy of inverse or denying the antecedent

Aim: Invalid Arguments Course: Math Literacy Reasoning and Fallacies If the argument is valid. state the law of reasoning that tells why the conclusion is true. If the argument is invalid, say so. 2 nd invalid fallacy of inverse Law of Detachment 1 st invalid fallacy of converse Law of Modus Tollens Law of Contrapositive

Aim: Invalid Arguments Course: Math Literacy Testing Validity 1.Use a letter to represent each simples statement in the argument. 2.Express the premises and the conclusion symbolically. 3.Write a symbolic conditional statement is the form [(premise 1) ˄ (premise 2) ˄...]  Conclusion 4.Construct a truth table for the conditional statement in step 3. 5.If the final column of the truth table has all trues, the conditional statement is a tautology and the argument is valid. If not all true, argument is not valid.

Aim: Invalid Arguments Course: Math Literacy Model Problem – 2 nd Invalid Argument