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

Slides:



Advertisements
Similar presentations
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.
Advertisements

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
3.5 – Analyzing Arguments with Euler Diagrams
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 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Statements and Quantifiers
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
RATIONALISM OR EMPIRICISM? PURE LOGIC OR A REALLY, REALLY GOOD GUESS?
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
Copyright © 2008 Pearson Education, Inc. Chapter 1.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
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.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to 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.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 2: The Basic Concepts of Set Theory
Arguments with Quantified Statements
a valid argument with true premises.
Chapter 2 The Basic Concepts of Set Theory
Chapter 3: Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 2 Limits Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
2 Chapter Introduction to Logic and Sets
Chapter 17 Linked Lists.
Chapter 19 Binary Search Trees.
Chapter 4 Inheritance.
Chapter 7 Functions of Random Variables (Optional)
Chapter 14 Graphs and Paths.
3 Logic The Study of What’s True or False or Somewhere in Between.
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Chapter 10 Datapath Subsystems.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 2 The Basic Concepts of Set Theory
Chapter 20 Hash Tables.
Searching for Guinea Pig B: Case Study in Online Research
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
Chapter 2 The Basic Concepts of Set Theory
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
Chapter 5 Algorithm Analysis.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
The Facts to Be Explained
6.4 Truth Tables for Arguments
Introduction: Some Representative Problems
SUMMARY Logic and Reasoning.
Circuit Characterization and Performance Estimation
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 2 Part 1 Data and Expressions.
Chapter 6 Dynamic Programming.
Chapter 2 Reference Types.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Chapter 4 Greedy Algorithms.
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:

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved

Chapter 3: Introduction to Logic 3.1 Statements and Quantifiers 3.2 Truth Tables and Equivalent Statements 3.3 The Conditional and Circuits 3.4 More on the Conditional 3.5 Analyzing Arguments with Euler Diagrams 3.6 Analyzing Arguments with Truth Tables © 2008 Pearson Addison-Wesley. All rights reserved

Section 3-5 Chapter 1 Analyzing Arguments with Euler Diagrams © 2008 Pearson Addison-Wesley. All rights reserved

Analyzing Arguments with Euler Diagrams Logical Arguments Arguments with Universal Quantifiers Arguments with Existential Quantifiers © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Logical Arguments A logical argument is made up of premises (assumptions, laws, rules, widely held ideas, or observations) and a conclusion. Together, the premises and the conclusion make up the argument. © 2008 Pearson Addison-Wesley. All rights reserved

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. © 2008 Pearson Addison-Wesley. All rights reserved

Arguments with Universal Quantifiers Several techniques can be used to check the validity of an argument. One of these is a visual technique based on Euler Diagrams. © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) Is the following argument valid? All cats are animals. Figgy is a cat. Figgy is an animal. © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) All cats are animals. Figgy is a cat. Figgy is an animal. Solution The diagram shows that Figgy is inside the region for “animals”. The argument is valid. Animals Cats x x represents Figgy. © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) Is the following argument valid? All sunny days are hot. Today is not hot Today is not sunny. © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) All sunny days are hot. Today is not hot Today is not sunny. Solution The diagram shows that today is outside the region for “sunny”. The argument is valid. Hot days x Sunny days x represents today © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) Is the following argument valid? All cars have wheels. That vehicle has wheels. That vehicle is a car. © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) All cars have wheels. That vehicle has wheels. That vehicle is a car. Solution The diagram shows “that vehicle” can be inside the region for “Cars” or outside it. The argument is invalid. Things that have wheels x ? Cars x ? x represents “that vehicle” © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Example: Using an Euler Diagram to Determine Validity (Existential Quantifier) Is the following argument valid? Some students drink coffee. I am a student . I drink coffee . © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) Some students drink coffee. I am a student . I drink coffee . Solution The diagram shows that “I” can be inside the region for “Drink coffee” or outside it. The argument is invalid. People that drink coffee I ? Students I ? © 2008 Pearson Addison-Wesley. All rights reserved