Section 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
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
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.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Adapted from Discrete Math
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.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
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.
Truth Tables for Negation, Conjunction, and Disjunction
2. The Logic of Compound Statements Summary
Conditional Statements
Valid and Invalid Arguments
AND.
Applied Discrete Mathematics Week 5: Mathematical Reasoning
CSE15 Discrete Mathematics 01/30/17
Chapter 1 Logic and Proofs Homework 1 Two merchants publish new marketing campaign to attract more customers. The first merchant launches a motto “Good.
Truth Tables and Equivalent Statements
Chapter 3 Logic Active Learning Lecture Slides
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Common logical forms Study the following four arguments.
Chapter 8 Logic Topics
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
CS201: Data Structures and Discrete Mathematics I
Mathematical Reasoning
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Section 3.4 Equivalent Statements
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
TRUTH TABLES continued.
Discrete Mathematics Lecture # 8.
Logic 3.1 Statements and Logical Connectives
Discrete Mathematics Dr.-Ing. Erwin Sitompul
1 Chapter An Introduction to Problem Solving
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Logic.
Conditional Statements
Section 3.6 Euler Diagrams and Syllogistic Arguments
Equivalent Statements
Do Now:.
Foundations of Discrete Mathematics
Section 3.3 Truth Tables for the Conditional and Biconditional
CHAPTER 3 Logic.
Valid and Invalid Arguments
Mathematical Reasoning
Section 3.4 Equivalent Statements
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
3.5 Symbolic Arguments.
CHAPTER 3 Logic.
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

Section 3.5 Symbolic Arguments

What You Will Learn Symbolic arguments Standard forms of arguments

Symbolic Arguments A symbolic argument consists of a set of premises and a conclusion. It is called a symbolic argument because we generally write it in symbolic form to determine its validity.

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.

Law of Detachment Also called modus ponens. Symbolically, the argument is written: Premise 1: p → q Premise 2: p Conclusion: ∴ q If [premise 1 and premise 2] then conclusion [(p → q) ⋀ p ] → q

To Determine Whether an Argument is Valid 1. Write the argument in symbolic form. 2. Compare the form of the argument with forms that are known to be either valid or invalid. If there are no known forms to compare it with, or you do not remember the forms, go to step 3.

To Determine Whether an Argument is Valid 3. If the argument contains two premises, write a conditional statement of the form [(premise 1) ⋀ (premise 2)] → conclusion 4. Construct a truth table for the statement above.

To Determine Whether an Argument is Valid 5. If the answer column of the truth 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 2: Determining the Validity of an Argument with a Truth Table Determine whether the following argument is valid or invalid. If you watch Good Morning America, then you see Robin Roberts. You did not see Robin Roberts. ∴ You did not watch Good Morning America.

Example 2: Determining the Validity of an Argument with a Truth Table Solution Let p: You watch Good Morning America. q: You see Robin Roberts. In symbolic form, the argument is p → q ~p ∴ ~p The argument is [(p → q) ⋀ ~q] → ~p.

Example 2: Determining the Validity of an Argument with a Truth Table Solution Construct a truth table. p q [(p → q) ⋀ ~ q] → ~p T F T F T F F T F T T F T 1 3 2 5 4 Since the answer, column 5, has all T’s, the argument is valid.

Standard Forms of Valid Arguments Law of Detachment Law of Contraposition Law of Syllogism Disjunctive Syllogism

Standard Forms of Invalid Arguments Fallacy of the Converse Fallacy of the Inverse

Example 4: Identifying a Standard Argument Determine whether the following argument is valid or invalid. If you are on Facebook, then you see my pictures. If you see my pictures, then you know I have a dog. ∴ If you are on Facebook, then you know I have a dog.

Example 4: Identifying a Standard Argument Solution Let p: You are on Facebook. q: You see my pictures. r: You know I have a dog. In symbolic form, the argument is p → q q → r ∴ p→ r It is the law of syllogism and is valid.

Example 5: Identifying Common Fallacies in Arguments Determine whether the following argument is valid or invalid. If it is snowing, then we put salt on the driveway. We put salt on the driveway. ∴ It is snowing.

Example 5: Identifying Common Fallacies in Arguments Solution Let p: It is snowing. q: We put salt on the driveway. In symbolic form, the argument is p → q q ∴ p It is in the form of the fallacy of the converse and it is a fallacy, or invalid.

Example 5: Identifying Common Fallacies in Arguments Determine whether the following argument is valid or invalid. If it is snowing, then we put salt on the driveway. It is not snowing. ∴We do not put salt on the driveway.

Example 5: Identifying Common Fallacies in Arguments Solution Let p: It is snowing. q: We put salt on the driveway. In symbolic form, the argument is p → q ~p ∴ ~q It is in the form of the fallacy of the inverse and it is a fallacy, or invalid.

Example 6: An Argument with Three Premises Use a truth table to determine whether the following argument is valid or invalid. If my cell phone company is Verizon, then I can call you free of charge. I can call you free of charge or I can send you a text message. I can send you a text message or my cell phone company is Verizon. ∴ My cell phone company is Verizon.

Example 6: An Argument with Three Premises Solution Let p: My cell phone company is Verizon. q: I can call you free of charge. r: I can send you a text message. In symbolic form, the argument is p → q q ⋁ r r ⋁ p ∴ p

Example 6: An Argument with Three Premises Solution Write the argument in the form (p → q) ⋀ (q ⋁ r) ⋀ (r ⋁ p)] → p. Construct a truth table.

Example 6: An Argument with Three Premises Solution

Example 6: An Argument with Three Premises Solution The answer, column 7, is not true in every case. Thus, the argument is a fallacy, or invalid.