3 Logic The Study of What’s True or False or Somewhere in Between.

Slides:



Advertisements
Similar presentations
Test the validity of this argument: Some lawyers are judges. Some judges are politicians. Therefore, some lawyers are politicians. A. Valid B. Invalid.
Advertisements

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
3.5 – Analyzing Arguments with Euler Diagrams
Test the validity of this argument: Some lawyers are judges. Some judges are politicians. Therefore, some lawyers are politicians. A. Valid B. Invalid.
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
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.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Inductive and Deductive Reasoning Geometry 1.0 – Students demonstrate understanding by identifying and giving examples of inductive and deductive reasoning.
For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.
Statements and Quantifiers
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
LOGIC CHAPTER 3 1. EULER DIAGRAMS: A PROBLEM-SOLVING TOOL
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
Validity All UH students are communists. All communists like broccoli. All UH students like broccoli.
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.
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.
Logic in Everyday Life.
Deductive Reasoning Chapter 2 Lesson 4.
Question of the Day!  We shared a lot of examples of illogical arguments!  But how do you make a LOGICAL argument? What does your argument need? What.
DEDUCTIVE REASONING MOVES FROM A GENERALIZATION THAT IS TRUE OR SELF-EVIDENT TO A MORE SPECIFIC CONCLUSION DEDUCTIVE REASONING.
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.
LOGICAL REASONING FOR CAT 2009.
Philosophical Method  Logic: A Calculus For Good Reason  Clarification, Not Obfuscation  Distinctions and Disambiguation  Examples and Counterexamples.
Study Questions for Quiz 1 1. The Concept of Validity (20 points) a. You will be asked to give the two different definitions of validity given in the lecture.
Thinking Mathematically Arguments and Truth Tables.
Do Now. Law of Syllogism ◦ We can draw a conclusion when we are given two true conditional statements. ◦ The conclusion of one statement is the hypothesis.
Deductive and induction reasoning
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.
Chapter Ten Relational Predicate Logic. 1. Relational Predicates We now broaden our coverage of predicate logic to include relational predicates. This.
Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.
Uniqueness Quantifier ROI for Quantified Statement.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Deductive reasoning.
Arguments with Quantified Statements
a valid argument with true premises.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Disjunctive Syllogism
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
5 Categorical Syllogisms
Truth Tables How to build them
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Evaluating truth tables
Sec. 2.3: Apply Deductive Reasoning
Testing for Validity and Invalidity
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.
Hurley … Chapter 6.5 Indirect Truth Tables
Logical Forms.
The Method of Deduction
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Premise: If it’s a school day, then I have Geometry class.
Validity & Invalidity Valid arguments guarantee true conclusions but only when all of their premises are true Invalid arguments do not guarantee true conclusions.
Section 3.6 Euler Diagrams and Syllogistic Arguments
6.4 Truth Tables for Arguments
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Phil2303 intro to logic.
SUMMARY Logic and Reasoning.
Syllogisms.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
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 Logic The Study of What’s True or False or Somewhere in Between

Using Euler Diagrams to Verify Syllogisms 3.5 Using Euler Diagrams to Verify Syllogisms Use Euler diagrams to identify a valid syllogism Use an Euler diagram to identify an invalid syllogism

Valid Syllogisms A syllogism consists of a set of statements called premises followed by a statement called a conclusion. A syllogism is valid if whenever its premises are all true, then the conclusion is true. If the conclusion can be false even though all the premises are true, then the syllogism is invalid.

Valid Syllogisms We can use Euler diagrams to determine the validity of a syllogism. Syllogism Euler Diagram

Valid Syllogisms Example (solution on next slide)

Valid Syllogisms Solution If Dante is not a good speller, then he cannot be a poet. The conclusion is valid. Remember: An argument can be valid even if the premises or the conclusion is false.

Invalid Syllogisms Example: Solution:

Invalid Syllogisms Example: Solution: The argument is invalid. The premises do not force the conclusion to hold.

Invalid Syllogisms The quantifier some can be misleading in syllogisms. All of these represent the premise “some A’s are B’s”.

Invalid Syllogisms The quantifier some can be misleading in syllogisms. All of these represent the premise “some A’s are B’s”.

Invalid Syllogisms The quantifier some can be misleading in syllogisms. All of these represent the premise “some A’s are B’s”.

Invalid Syllogisms Example: (solution on next slide)

Invalid Syllogisms Solution: Possible Euler diagrams: The conclusion does not follow from the premises. The syllogism is invalid.

Invalid Syllogisms

Implicit Conditions in Euler Diagrams Extra conditions are always present in Euler diagrams. (example on next slide)

Implicit Conditions in Euler Diagrams Example: (solution on next slide)

Implicit Conditions in Euler Diagrams Solution: