3.5 – Analyzing Arguments with Euler Diagrams

Slides:



Advertisements
Similar presentations
Rules of Inference Rosen 1.5.
Advertisements

Part 2 Module 3 Arguments and deductive reasoning Logic is a formal study of the process of reasoning, or using common sense. Deductive reasoning involves.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Valid arguments A valid argument has the following property:
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
LogicandEvidence Scientific argument. Logic Reasoning –Deductive –Inductive.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Statements and Quantifiers
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Adapted from Discrete Math
Part 2 Module 3 Arguments and deductive reasoning Logic is a formal study of the process of reasoning, or using common sense. Deductive reasoning involves.
RATIONALISM OR EMPIRICISM? PURE LOGIC OR A REALLY, REALLY GOOD GUESS?
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.
Copyright © 2008 Pearson Education, Inc. Chapter 1.
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.
GLE Explore the concept of premises, including false premises. Intro to Logic.
Verifying Arguments MATH 102 Contemporary Math S. Rook.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
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.
Aerospace Engineering Laboratory I
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.
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.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Deductive Reasoning Valid Arguments
Arguments with Quantified Statements
2. The Logic of Compound Statements Summary
a valid argument with true premises.
Lecture Notes 8 CS1502.
Discrete Mathematics Logic.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Evaluating truth tables
2 Chapter Introduction to Logic and Sets
3 Logic The Study of What’s True or False or Somewhere in Between.
Argument Lecture 5.
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
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.
Review To check an argument with a tree:.
Discrete Mathematics Lecture # 8.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
Discrete Mathematics Logic.
1 Chapter An Introduction to Problem Solving
Section 3.6 Euler Diagrams and Syllogistic Arguments
Chapter 7. Propositional and Predicate Logic
COMP 1380 Discrete Structures I Thompson Rivers University
6.4 Truth Tables for Arguments
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
SUMMARY Logic and Reasoning.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
ID1050– Quantitative & Qualitative Reasoning
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:

3.5 – Analyzing Arguments with Euler Diagrams Logical Arguments A logical argument is made up of premises (assumptions, laws, rules, widely held ideas, or observations) and a conclusion Valid and Invalid Arguments An argument is valid if the fact that all the premises are true forces the conclusion to be true. An argument that is not valid is invalid. It is called a fallacy. Arguments with Universal Quantifiers Several techniques can be used to check the validity of an argument. One visual technique is based on Euler Diagrams.

Using an Euler Diagram to Determine Validity 3.5 – Analyzing Arguments with Euler Diagrams Using an Euler Diagram to Determine Validity Is the following argument valid? All cats are animals. Fuzzy is a cat. Fuzzy is an animal. x represents Fuzzy. Animals The diagram shows that Fuzzy is inside the region for “animals”. Cats x The argument is valid.

Using an Euler Diagram to Determine Validity 3.5 – Analyzing Arguments with Euler Diagrams Using an Euler Diagram to Determine Validity Is the following argument valid? All sunny days are hot. Today is not hot Today is not sunny. x represents today Hot days x The diagram shows that today is outside the region for “sunny”. Sunny days The argument is valid.

Using an Euler Diagram to Determine Validity 3.5 – Analyzing Arguments with Euler Diagrams Using an Euler Diagram to Determine Validity Is the following argument valid? All cars have wheels. That vehicle has wheels. That vehicle is a car. x represents “that vehicle” Things that have wheels The diagram shows “that vehicle” can be inside the region for “Cars” or outside it. x ? Cars x ? The argument is invalid.

Using an Euler Diagram to Determine Validity 3.5 – Analyzing Arguments with Euler Diagrams Using an Euler Diagram to Determine Validity Is the following argument valid? Some students drink coffee. I am a student . I drink coffee . The diagram shows that “I” can be inside the region for “Drink coffee” or outside it. People that drink coffee I ? Students The argument is invalid. I ?

3.6 – Analyzing Arguments with Truth Tables Use an Euler Diagram with quantifiers such as: “all,” “some,” “every,” “no,” etc. Use a Truth Table if the argument does not contain any quantifiers. Is the following argument valid? If the day is sunny, then it is hot. Today is not hot Today is not sunny. p: if the day is sunny p: if the day is not sunny q: it is hot q: it is not hot

3.6 – Analyzing Arguments with Truth Tables Is the following argument valid? If the day is sunny, then it is hot. Today is not hot Today is not sunny. p: if the day is sunny p: if the day is not sunny q: it is hot q: it is not hot p  q q p Tautology p q p q p  q (p  q)   q ((p  q)   q)  p T T F F T F T T F F T F F T F T T F T F T F F T T T T T Valid Argument

3.6 – Analyzing Arguments with Truth Tables Is the following argument valid? I will go to the fair or I will go to the beach. I did not go to the fair. I went to the beach. p: I go to the fair p: I do not go to the fair q: I go to the beach q: I do not go to the beach. p  q p q Tautology p q p p  q (p  q)   p ((p  q)   p)  q T T F T F T T F F T F T F T T T T T F F T F F T Valid Argument

3.6 – Analyzing Arguments with Truth Tables Is the following argument valid? If you go to the jungle, you will see a tiger. You did not go to the jungle. You did not see a tiger. p: go to the jungle p: do not go to the jungle q: will see a tiger q: will not see a tiger p  q p q Not a tautology p q p q p  q (p  q)   p ((p  q)   p)  q T T F F T F T T F F T F F T F T T F T T F F F T T T T T Invalid Argument