Valid arguments A valid argument has the following property:

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
Advertisements

Truth Functional Logic
Chapter 21: Truth Tables.
Logic & Critical Reasoning
3.5 – Analyzing Arguments with Euler Diagrams
Part 2 Module 2 The Conditional Statement. The Conditional Statement A conditional statement is a statement of the form "If p, then q," denoted pqpq.
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.
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.
Part 2 Module 2 The Conditional Statement. The Conditional Statement A conditional statement is a statement of the form "If p, then q," denoted pqpq.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Critical Thinking: A User’s Manual
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.
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!
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.
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.
Truth-Table Definition of Validity An argument is truth-table valid if it is impossible for the premises to all be True and the conclusion False. I.e.,
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 10 Logic Section 10.1 Statements Section 10.2 Conditional Statements Section.
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Section 3.5 Symbolic Arguments
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
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.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
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.
Study Questions for Quiz 1 1. The Concept of Validity (20 points) a. You will be asked to give the two different definitions of validity given in the lecture.
Thinking Mathematically Arguments and Truth Tables.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
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.
If then Therefore It is rainingthe ground is wet It is raining the ground is wet.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Truth Tables, Continued 6.3 and 6.4 March 14th. 6.3 Truth tables for propositions Remember: a truth table gives the truth value of a compound proposition.
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Common logical forms Study the following four arguments.
Truth Tables How to build them
Evaluating truth tables
3 Logic The Study of What’s True or False or Somewhere in Between.
Validity and Soundness
Argument Lecture 5.
Testing for Validity and Invalidity
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
TRUTH TABLE TO DETERMINE
TRUTH TABLES.
TRUTH TABLES continued.
Discrete Mathematics Lecture # 8.
Let us build the tree for the argument Q>-P | P>Q.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
The most important idea in logic: Validity of an argument.
Deductive Arguments: Checking for Validity
Deductive Arguments: More Truth Tables
Section 3.7 Switching Circuits
6.4 Truth Tables for Arguments
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Phil2303 intro to logic.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Philosophical Methods
Propositional Logic 1) Introduction Copyright 2008, Scott Gray.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Validity and Soundness, Again
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:

Valid arguments A valid argument has the following property: It is impossible for the conclusion to be false, if we assume that every premise is true. In a valid argument, “the truth of the premises forces the truth of the conclusion.”

Use of truth tables to analyze arguments 1. Symbolize (consistently) all of the premises and the conclusion. 2. Make a truth table having a column for each premise and for the conclusion. 3. If there is a row in the truth table where every premise column is true but the conclusion column is false (a counterexample row) then the argument is invalid. If there are no counterexample rows, then the argument is valid.

Why does this method work? When we have filled in the truth table, we are checking to see if there is a row where the conclusion is false while every premise is true. If there is a row where the conclusion is false while every premise is true, then the truth table has shown that it is possible for the conclusion to be false at the same time that every premise is assumed to be true: this is exactly the definition of an invalid argument.

Exercise Use a truth table to test the validity of the following argument. If I enter the poodle den, then I will carry my electric poodle prod or my can of mace. I am carrying my electric poodle prod but not my can of mace. Therefore, I will enter the poodle den. A. Valid B. Invalid

Solution If I enter the poodle den, then I will carry my electric poodle prod or my can of mace.
 I am carrying my electric poodle prod but not my can of mace.
 Therefore, I will enter the poodle den. 

Step 1: Symbolize Let p: I enter the poodle den q: I carry my electric poodle prod r: I carry my can of mace p(qr) q  ~r  p

Solution, page 2 Step 2: Make a truth table having a column for each premise and a column for the conclusion. p(qr) q  ~r  p

Solution, page 3 Step 3: Is there a row where the conclusion is false while both premises are true? Yes, the sixth row shows that the argument is INVALID.

Exercise Test the validity of the argument. I don’t like muskrats. If I own a badger or I don’t own a wolverine, then I like muskrats. Therefore, I own a wolverine and I don’t own a badger. A. Valid B. Invalid

Solution I don’t like muskrats. If I own a badger or I don’t own a wolverine, then I like muskrats. Therefore, I own a wolverine and I don’t own a badger. First, reduce the argument to symbols. Let p: I like muskrats q: I own a badger r: I own a wolverine With this choice of symbols, the argument as the following form: ~p (q~r) p  r  ~q

Solution, page 2 Step 2: Make a truth table having a column for each premise and a column for the conclusion. ~p (q~r) p  r  ~q Step 3: There is NO ROW where the conclusion is false while both premises are true, so the argument is VALID.

Exercise The Argue-mentor, Part 3 http://www.math.fsu.edu/~wooland/arg3/pats.html Test the validity of this argument. ~p~q q ~p Valid
 B. Invalid

Solution Below is a truth table for the argument. (There may be some redundant columns.) The three columns in bold are the important columns. An argument is INVALID if it is possible for the conclusion to be false while every premise is true. There is no row where the conclusion is false while every premise is true, so the argument is valid.