3.5 Symbolic Arguments.

Slides:



Advertisements
Similar presentations
Geometry Chapter 2 Terms.
Advertisements

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Functional Logic
Chapter 21: Truth Tables.
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.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
1.5 Rules of Inference.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.4 Equivalent Statements.
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.
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.
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.
From conclusions by applying the laws of logic. Symbolic Notation Conditional statement If p, then qp ⟶q Converseq⟶p Biconditional p ⟷ q.
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.
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.
Section 2.3: Deductive Reasoning
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
Warm up… Write the converse, inverse, and contrapositive. Whole numbers that end in zero are even. Write as a biconditional. The whole numbers are the.
5-Minute Check Converse: Inverse: Contrapositive: Hypothesis: Conclusion: The measure of an angle is less than 90  The angle is acute If an angle is.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Logic.
2. The Logic of Compound Statements Summary
AND.
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
How do I show that two compound propositions are logically equivalent?
Disjunctive Syllogism
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Truth Tables How to build them
Chapter 8 Logic Topics
CS201: Data Structures and Discrete Mathematics I
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Section 3.4 Equivalent Statements
TRUTH TABLES continued.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Equivalent Statements
Section 3.6 Euler Diagrams and Syllogistic Arguments
Equivalent Statements
Do Now:.
Introductory Logic PHI 120
Section 3.3 Truth Tables for the Conditional and Biconditional
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
CHAPTER 3 Logic.
Truth Tables for the Conditional and Biconditional
CHAPTER 3 Logic.
Section 3.4 Equivalent Statements
TODAY’S OBJECTIVE: Standard: MM1G2
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
2-2 Logic Part 2 Truth Tables.
CS201: Data Structures and Discrete Mathematics I
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.
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:

3.5 Symbolic Arguments

Objective: SWBAT determine if an argument is valid or invalid using truth tables and the standard forms of arguments. SWBAT translate arguements into symbolic form and determine if they are valid or invalid.

Symbolic Arguments An argument is valid when its conclusion necessarily follows from a given set of premises. An argument is invalid (or a fallacy) when the conclusion does not necessarily follow from the given set of premises.

Valid or Invalid? If the truth table answer column is true in every case, then the statement is a tautology, and the argument is valid. If the truth table answer column is not true in every case then the statement is not a tautology, and the argument is invalid.

Law of Detachment The argument form symbolically written: Premise 1: Conclusion: Change to the following to create a truth table If [ premise 1 and premise 2 ] then conclusion [ (p g q) ^ p ] g q

Determine Whether an Argument is Valid Write the argument in symbolic form. Compare the form with forms that are known to be either valid or invalid. If the argument contains two premises, write a conditional statement of the form [(premise 1) ^ (premise 2)] g conclusion Construct a truth table for the statement in step 3. If the answer column of the table has all trues, the statement is a tautology, and the argument is valid. If the answer column of the table does not have all trues, the argument is invalid.

Example: Determining Validity with a Truth Table Determine whether the following argument is valid or invalid. If you score 90% on the final exam, then you will get an A for the course. You will not get an A for the course. You do not score 90% on the final exam.

Example: Determining Validity with a Truth Table Solution: Let p: You score 90% on the final exam. q: You will get an A in the course. In symbolic form the argument is: p g q ~q ~p Construct a truth table.

Example: Determining Validity with a Truth Table Fill-in the table in order, as follows: Column 1 is answer to if p then q p q [(p g q) ^ ~ q] g ~p T F T F T F F T F T T F T 1 3 2 5 4 Since column 5 has all T’s, the argument is valid.

Valid Arguments You do not need to creat a truth table if you identify one of these arguments Law of Detachment Law of Syllogism Law of Contraposition Disjunctive Syllogism

Example: Determine if the following argument is valid. ~p q q r ~p r Valid: Law of Syllogism

Invalid Arguments Fallacy of the Converse Fallacy of the Inverse

Example: Determin the Validity using a standard form p ~q ~q p Invalid: Fallacy of the Converse

Homework P. 147 # 7 – 12 all, 15 -63 (x3)