3.6 Analyzing Arguments with Truth Tables

Slides:



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

Truth Functional Logic
3.5 – Analyzing Arguments with Euler Diagrams
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.
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
Use a truth table to determine the validity or invalidity of this argument. First, translate into standard form “Martin is not buying a new car, since.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Through the Looking Glass, 1865
Introduction to Logic Logical Form: general rules
Statements and Quantifiers
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Critical Thinking: A User’s Manual
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!
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.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
Logical Inferences. De Morgan’s Laws ~(p  q)  (~p  ~q)~(p  q)  (~p  ~q) ~(p  q)  (~p  ~q)~(p  q)  (~p  ~q)
Valid and Invalid Arguments
Section 3.5 Symbolic Arguments
Reason and Argument Chapter 6 (2/3). A symbol for the exclusive ‘or’ We will use ұ for the exclusive ‘or’ Strictly speaking, this connective is not necessary.
Verifying Arguments MATH 102 Contemporary Math S. Rook.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Deductive Arguments.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
1 DISJUNCTIVE AND HYPOTHETICAL SYLLOGISMS DISJUNCTIVE PROPOSITIONS: E.G EITHER WHALES ARE MAMMALS OR THEY ARE VERY LARGE FISH. DISJUNCTS: WHALES ARE MAMMALS.(P)
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.
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
LOGIC.
Thinking Mathematically Arguments and Truth Tables.
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.
Rules of Inference Dr. Yasir Ali.
Propositional Logic A symbolic representation of deductive inference. Use upper case letters to represent simple propositions. E.g. Friday class rocks.
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.
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
Logic: The Language of Philosophy. What is Logic? Logic is the study of argumentation o In Philosophy, there are no right or wrong opinions, but there.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Chapter 1 Logic and proofs
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
2. The Logic of Compound Statements Summary
CSE15 Discrete Mathematics 01/30/17
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Common logical forms Study the following four arguments.
Rules of Inference Section 1.6.
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Logical Forms.
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
TRUTH TABLES continued.
1 Chapter An Introduction to Problem Solving
1 Chapter An Introduction to Problem Solving
CHAPTER 3 Logic.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
3.5 Symbolic Arguments.
CHAPTER 3 Logic.
Presentation transcript:

3.6 Analyzing Arguments with Truth Tables

Truth Tables (Two Premises) Determine whether the argument is valid or invalid. If the floor is dirty, then I must mop it. The floor is dirty. _ I must mop it. Testing the Validity of an Argument with a Truth Table Assign letters to represent each component in the argument. Express each premise and the conclusion symbolically. Form the symbolic statement of the entire argument (conjunction of ALL the premises = antecedent of a conditional, conclusion = consequent). Complete a truth table for the conditional formed in Step 3. If it is a tautology, the argument is valid (otherwise, it’s invalid).

p q p  q (p  q)  p [(p  q)  p]  q The pattern of the argument shown here, p  q p _ q is a common one, known as modus ponens, or the law of detachment.

Using a Truth Table to Determine Validity Determine whether the argument is valid or invalid. If my check arrives in time, I’ll register for fall semester. I’ve registered for fall semester _ My check arrived in time. If a conditional and its converse were logically equivalent, then this argument would be valid. Therefore, an argument in the form p  q q _ p is an example of what is called the fallacy of the converse. p q p  q (p  q)  q [(p  q)  q]  p

Using a Truth Table to Determine Validity Determine whether the argument is valid or invalid. If a man could be in two places at once, I’d be with you. I am not with you. _ A man can’t be in two places at once. An argument in the form of p  q ~q _ ~p is called modus tollens.

Using a Truth Table to Determine Validity Determine whether the argument is valid or invalid. If it rains today, then I’ll stay home. It didn’t rain today. I didn’t stay home. An argument in the form p  q ~p _ ~q is called the fallacy of the inverse.

Using a Truth Table to Determine Validity Determine whether the argument is valid or invalid. I‘ll buy a car or I’ll take a vacation. I won’t buy a car. _ I’ll take a vacation If an argument in the form p  q ~p _ q then it is valid by the law of disjunctive syllogism.

Using a Truth Table to Determine Validity Determine whether the argument is valid or invalid. If it squeaks, then I use WD-40. If I use WD-40, then I must go to the hardware store. If it squeaks, then I must go to the hardware store. An argument in the form p  q q  r p  r is called reasoning by transitivity (or the law of transitivity).

Summary of Argument Forms Valid Argument Forms Modus Ponens Modus Tollens Disjunctive Syllogism Law of Transitivity p  q p  q p ~q ~p q  r q p  r Invalid Argument Forms (Fallacies) Fallacy of the Converse Fallacy of the Inverse p  q q ~p p ~q