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

Slides:



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

Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
The Foundations: Logic and Proofs
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
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.
Adapted from Discrete Math
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
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 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.
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.
 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.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
2. The Logic of Compound Statements Summary
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
Chapter 3: Introduction to Logic
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Demonstrating the validity of an argument using syllogisms.
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Proof Techniques.
Rules of Inference Section 1.6.
6.1 Symbols and Translation
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 8 Logic Topics
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.
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
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.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Section 3.4 Equivalent Statements
CS 220: Discrete Structures and their Applications
Thinking Critically Copyright © 2011 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.
Discrete Mathematics Logic.
1 Chapter An Introduction to Problem Solving
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Equivalent Statements
Foundations of Discrete Mathematics
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Section 3.4 Equivalent Statements
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
3.5 Symbolic Arguments.
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-6 Chapter 1 Analyzing Arguments with Truth Tables © 2008 Pearson Addison-Wesley. All rights reserved

Analyzing Arguments with Truth Tables Truth Tables (Two Premises) Valid and Invalid Argument Forms Truth Tables (More Than Two Premises) Arguments of Lewis Carroll © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Truth Tables In section 3.5 Euler diagrams were used to test the validity of arguments. These work well with simple arguments but may not work well with more complex ones. If the words “all,” “some,” or “no” are not present, it may be better to use a truth table than an Euler diagram to test validity. © 2008 Pearson Addison-Wesley. All rights reserved

Testing the Validity of an Argument with a Truth Table Step 1 Assign a letter to represent each component statement in the argument. Step 2 Express each premise and the conclusion symbolically. Continued on the next slide… © 2008 Pearson Addison-Wesley. All rights reserved

Testing the Validity of an Argument with a Truth Table Step 3 Form the symbolic statement of the entire argument by writing the conjunction of all the premises as the antecedent of a conditional statement, and the conclusion of the argument as the consequent. Step 4 Complete the truth table for the conditional statement formed in Step 3. If it is a tautology, then the argument is valid; otherwise it is invalid. © 2008 Pearson Addison-Wesley. All rights reserved

Example: Truth Tables (Two Premises) Is the following argument valid? If the door is open, then I must close it. The door is open. I must close it. © 2008 Pearson Addison-Wesley. All rights reserved

Example: Truth Tables (Two Premises) If the door is open, then I must close it. The door is open. I must close it. Solution Let p represent “the door is open” and q represent “I must close it.” © 2008 Pearson Addison-Wesley. All rights reserved

Example: Truth Tables (Two Premises) Premise and premise implies conclusion The truth table is on the next slide. © 2008 Pearson Addison-Wesley. All rights reserved

Example: Truth Tables (Two Premises) The truth table below shows that the argument is valid. p q T T T T F F T F F © 2008 Pearson Addison-Wesley. All rights reserved

© 2008 Pearson Addison-Wesley. All rights reserved Valid Argument Forms Modus Ponens Modus Tollens Disjunctive Syllogism Reasoning by Transitivity © 2008 Pearson Addison-Wesley. All rights reserved

Invalid Argument Forms (Fallacies) Fallacy of the Converse Fallacy of the Inverse © 2008 Pearson Addison-Wesley. All rights reserved

Example: Truth Tables (More Than Two Premises) Determine whether the argument is valid or invalid. If Pat goes skiing, then Amy stays at home. If Amy does not stay at home, then Cade will play video games. Cade will not play video games. Therefore, Pat does not go skiing. Solution Let p represent “Pat goes skiing,” let q represent “Amy stays at home,” and let r represent “Cade will play video games.” © 2008 Pearson Addison-Wesley. All rights reserved

Example: Truth Tables (More Than Two Premises) So we have This leads to the statement The truth table is on the next slide. © 2008 Pearson Addison-Wesley. All rights reserved

Example: Truth Tables (More Than Two Premises) p q r T T T T T T F F T F T T F F F T T F T F F F T F F F © 2008 Pearson Addison-Wesley. All rights reserved

Example: Truth Tables (More Than Two Premises) Because the final column does not contain all Ts, statement is not a tautology and the argument is invalid. © 2008 Pearson Addison-Wesley. All rights reserved

Example: Arguments of Lewis Carroll Supply a conclusion that yields a valid argument for the following premises. Babies are illogical. Nobody is despised who can manage a crocodile. Illogical persons are despised. Let p be “you are a baby,” let q be “you are logical,” let r be “you can manage a crocodile,” and let s be “you are despised.” © 2008 Pearson Addison-Wesley. All rights reserved

Example: Arguments of Lewis Carroll With these letters, the statements can be written symbolically as Beginning with p and using a contrapositive we can get © 2008 Pearson Addison-Wesley. All rights reserved

Example: Arguments of Lewis Carroll Repeated use of reasoning by transitivity gives the conclusion leading to a valid argument. In words, the conclusion is “If you are a baby, then you cannot manage a crocodile.” © 2008 Pearson Addison-Wesley. All rights reserved