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

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.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 1.
Chapter 15 Geography, Climate, and Natural Resources.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 2 Application Layer. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 2-2.
Chapter 13 Income Inequality. Copyright © 2005 Pearson Addison-Wesley. All rights reserved
Chapter 1 The Facts to Be Explained. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 1-2.
Chapter 3 Transport Layer. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 3-2.
Chapter 6 Human Capital. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 6-2.
Chapter 8 The Role of Technology in Growth. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 8-2.
Chapter 7 Multimedia Networking. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 7-2.
Chapter 16 Resources and the Environment at the Global Level.
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?
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.
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.
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.
Deductive Reasoning Chapter 2 Lesson 4.
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.
 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.
Deductive Reasoning Valid Arguments
Arguments with Quantified Statements
a valid argument with true premises.
Chapter 3: Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
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
3 Logic The Study of What’s True or False or Somewhere in Between.
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 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
Section 3.6 Euler Diagrams and Syllogistic Arguments
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
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.
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:

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

© 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.5Analyzing Arguments with Euler Diagrams 3.6Analyzing Arguments with Truth Tables

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

© 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 Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) Sunny days x Solution The diagram shows that today is outside the region for “sunny”. The argument is valid. Hot days x represents today All sunny days are hot. Today is not hot Today is not sunny.

© 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 Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) Solution The diagram shows “that vehicle” can be inside the region for “Cars” or outside it. The argument is invalid. All cars have wheels. That vehicle has wheels. That vehicle is a car. Things that have wheels Cars x represents “that vehicle” x ?

© 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 Example: Using an Euler Diagram to Determine Validity (Universal Quantifier) Solution The diagram shows that “I” can be inside the region for “Drink coffee” or outside it. The argument is invalid. Some students drink coffee. I am a student. I drink coffee. People that drink coffee Students I ?