2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.

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.
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
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Adapted from Discrete Math
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.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
3.6 Analyzing Arguments with Truth Tables
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.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 10 Logic Section 10.1 Statements Section 10.2 Conditional Statements Section.
Section 3.5 Symbolic Arguments
Verifying Arguments MATH 102 Contemporary Math S. Rook.
2.2 Statements, Connectives, and Quantifiers
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
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.
Deductive Reasoning Chapter 2 Lesson 4.
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.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
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.
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.
Presented by: Tutorial Services The Math Center
2. The Logic of Compound Statements Summary
Chapter 1 Lessons 1-4 to 1-8.
Truth Tables for Negation, Conjunction, and Disjunction
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
Chapter 8 Logic Topics
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.
CS201: Data Structures and Discrete Mathematics I
Mathematical Reasoning
Drawing and Supporting Conclusions
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
TRUTH TABLES.
CS 220: Discrete Structures and their Applications
TRUTH TABLES continued.
Conditional Original IF-THEN statement.
Inference Rules: Tautologies
1 Chapter An Introduction to Problem Solving
1 Chapter An Introduction to Problem Solving
Premise: If it’s a school day, then I have Geometry class.
Conditional Statements
Introductory Logic PHI 120
CHAPTER 3 Logic.
6.4 Truth Tables for Arguments
Mathematical Reasoning
TODAY’S OBJECTIVE: Standard: MM1G2
TODAY’S OBJECTIVE: Standard: MM1G2
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
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.
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.
CHAPTER 3 Logic.
Presentation transcript:

2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common fallacies.

We use truth tables to determine whether arguments are valid. An argument is a series of statements called premises followed by a single statement called the conclusion. An argument is valid if whenever all the premises are true, then the conclusion must also be true. The law of detachment can be written in the form [(p q) ^ p] q. The law of contraposition can be written in the form [(p q) ^ (~ q)] (~ p).

Verifying an Argument 1.Write the argument symbolically. 2.Join the premises together using the and connective. 3.Form a conditional statement using the conjunction from step 2 for the hypothesis and the conclusion of the argument as the conclusion of the conditional. 4.If the statement you form in step 3 is tautology, then the argument is valid. If there are any F’s in the final column, then the argument is not valid.

Arguments are often one of several standard forms. Valid Arguments Law of Detachment Law of Contraposition Law of Syllogism Disjunctive Syllogism p q p q p q ~ q ~ p p q q r p r p q ~ p q

Invalid Arguments Fallacy of the ConverseFallacy of the Inverse p q q p p q ~ p ~ q Keep in mind that the symbolic form, not the content, determines the validity of an argument.

Classwork/Homework Classwork – Page 120 (11 – 27 odd) Homework – Page 120 (12 – 28 even)