© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
Advertisements

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Chapter 21: Truth Tables.
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
Common logical forms Study the following four arguments.
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid 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
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!
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.4 Equivalent Statements.
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
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.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
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.
Validity All UH students are communists. All communists like broccoli. All UH students like broccoli.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Section 3.5 Symbolic Arguments
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.
Conditional Statements
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
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.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional.
Thinking Mathematically Arguments and Truth Tables.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
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.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.
Introduction to Logic © 2008 Pearson Addison-Wesley.
2. The Logic of Compound Statements Summary
Chapter 3 Logic Active Learning Lecture Slides
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Chapter 8 Logic Topics
3 Logic The Study of What’s True or False or Somewhere in Between.
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
TRUTH TABLES continued.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Deductive Arguments: Checking for Validity
Section 3.7 Switching Circuits
CHAPTER 3 Logic.
6.4 Truth Tables for Arguments
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CHAPTER 3 Logic.
Logic and Reasoning.
SUMMARY Logic and Reasoning.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Philosophical Methods
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:

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic

© 2010 Pearson Prentice Hall. All rights reserved Arguments and Truth Tables

© 2010 Pearson Prentice Hall. All rights reserved. Objectives 1.Use truth tables to determine validity. 2.Recognize and use forms of valid and invalid arguments. 3

© 2010 Pearson Prentice Hall. All rights reserved. Arguments An Argument consists of two parts: –Premises: the given statements. –Conclusion: the result determined by the truth of the premises. Valid Argument: The conclusion is true whenever the premises are assumed to be true. Invalid Argument: Also called a fallacy Truth tables can be used to test validity. 4

© 2010 Pearson Prentice Hall. All rights reserved. Testing the Validity of an Argument with a Truth Table 5

© 2010 Pearson Prentice Hall. All rights reserved. Example 1: Did the Pickiest Logician in the Galaxy Foul Up? In Star Trek, the spaceship Enterprise is hit by an ion storm, causing the power to go out. Captain Cook wonders if Mr. Scott is aware of the problem. Mr. Spock replies, “If Mr. Scott is still with us, the power should be on momentarily.” Moments later the ship’s power comes back on. Argument: If Mr. Scott is still with us, then the power will come on. The power comes on. Therefore, Mr. Scott is still with us. Determine whether the argument is valid or invalid. 6

© 2010 Pearson Prentice Hall. All rights reserved. Example 1 continued Solution Step 1: p: Mr. Scott is still with us. q: The power will come back on. Step 2: Write the argument in symbolic form: p  q If Mr. Scott is still with us, then the power will come on. q The power comes on.  pMr. Scott is still with us. Step 3: Write the symbolic statement. [(p  q) ˄ q]  p 7

© 2010 Pearson Prentice Hall. All rights reserved. Example 1 continued Step 4: Construct a truth table for the conditional statement. p q p  q(p  q)  q[(p  q)  q]  p T TTT T FFFT F TTTF F TFT Step 5: Spock’s argument is invalid, or a fallacy. 8

© 2010 Pearson Prentice Hall. All rights reserved. Example 2: Determining Validity with a Truth Table Determine if the following argument is valid: “I can’t have anything more to do with the operation. If I did, I’d have to lie to the Ambassador. And I can’t do that.” —Henry Bromell 9

© 2010 Pearson Prentice Hall. All rights reserved. Example 2 continued Solution: We can express the argument as follows: If I had anything more to do with the operation, I’d have to lie to the Ambassador. I can’t lie to the Ambassador. Therefore, I can’t have anything more to do with the operation. Solution: We can express the argument as follows: If I had anything more to do with the operation, I’d have to lie to the Ambassador. I can’t lie to the Ambassador. Therefore, I can’t have anything more to do with the operation. 10

© 2010 Pearson Prentice Hall. All rights reserved. Example 2 continued Step 1: Use a letter to represent each statement in the argument: p: I have more to do with the operation q: I have to lie to the Ambassador. 11

© 2010 Pearson Prentice Hall. All rights reserved. Example 2 continued Step 2: Express the premises and the conclusion symbolically. p  q If I had anything more to do with the operation, I’d have to lie to the Ambassador. ~q I can’t lie to the Ambassador.  ~pTherefore, I can’t have anything more to do with the operation. Step 3: Write a symbolic statement: [(p  q)  ~q ]  ~ p 12

© 2010 Pearson Prentice Hall. All rights reserved. Example 2 continued Step 4: Construct the truth table. Step 5: The form of this argument is called contrapositive reasoning. It is a valid argument. p q p  q ~q (p  q)  ~q ~ p [(p  q)  ~q ]  ~ p T TFFFT T FFTFFT F TTFFTT F TTTTT 13

© 2010 Pearson Prentice Hall. All rights reserved. Standard Forms of Arguments 14

© 2010 Pearson Prentice Hall. All rights reserved. Example 4: Determining Validity Without Truth Tables Determine whether this argument is valid or invalid: There is no need for surgery because if there is a tumor then there is a need for surgery but there is no tumor. Solution: p: There is a tumor q: There is a need for surgery. 15

© 2010 Pearson Prentice Hall. All rights reserved. Example 4 continued Expressed symbolically: If there is a tumor then there is need for surgery. p  q There is no tumor.. ~p Therefore, there is no need for surgery.  ~q The argument is in the form of the fallacy of the inverse and is therefore, invalid. 16