1 Valid and Invalid Arguments CS 202 Epp Section 1.3 Aaron Bloomfield.

Slides:



Advertisements
Similar presentations
Rules of Inference Rosen 1.5.
Advertisements

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Announcements Grading policy No Quiz next week Midterm next week (Th. May 13). The correct answer to the quiz.
1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.
The Foundations: Logic and Proofs
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
Chapter 3. Mathematical Reasoning 3.1 Methods of proof A theorem is a statement that can be shown to be true. A proof is to demonstrate that a theorem.
Muhammad Arief download dari
CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
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.
Logic 3 Tautological Implications and Tautological Equivalences
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Introduction to Logic Logical Form: general rules
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
CS 202 Rosen section 1.5 Aaron Bloomfield
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Propositional Logic.
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 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Copyright © Curt Hill Rules of Inference What is a valid argument?
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Propositional Proofs 2.
Valid and Invalid Arguments
1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.
1 Basic Proof Methods I Basic Proof Methods II Proofs Involving Quantifiers.
1 Methods of Proof. 2 Consider (p  (p→q)) → q pqp→q p  (p→q)) (p  (p→q)) → q TTTTT TFFFT FTTFT FFTFT.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Discrete Structures (DS)
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
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.
LOGIC.
Rules of Inference Dr. Yasir Ali.
1 Course Summary CS 202 Aaron Bloomfield. 2 Outline A review of the proof methods gone over in class Interspersed with the most popular demotivators from.
Rules of Inference Section 1.6. Arguments in Propositional Logic A argument in propositional logic is a sequence of propositions. All but the final proposition.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
CSci 2011 Discrete Mathematics Lecture 4 CSci 2011.
Methods of Proof – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Methods of Proof Reading: Kolman, Section 2.3.
Proof Review CS 202 Aaron Bloomfield Spring 2007.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
CSci 2011 Discrete Mathematics Lecture 5 CSci 2011.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
2. The Logic of Compound Statements Summary
Methods of Proof Aaron Bloomfield.
CSE15 Discrete Mathematics 01/30/17
In this slide set… Rules of inference for propositions
Discrete Mathematics Logic.
Chapter 1 Logic and Proofs Homework 1 Two merchants publish new marketing campaign to attract more customers. The first merchant launches a motto “Good.
COMP 1380 Discrete Structures I Thompson Rivers University
Proof Techniques.
Rules of Inference Section 1.6.
Information Technology Department
Mathematical Reasoning
Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Inference Rules: Tautologies
Discrete Mathematics Logic.
Information Technology Department SKN-SITS,Lonavala.
COMP 1380 Discrete Structures I Thompson Rivers University
Valid and Invalid Arguments
Mathematical Reasoning
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

1 Valid and Invalid Arguments CS 202 Epp Section 1.3 Aaron Bloomfield

2 Modus Ponens example Assume you are given the following two statements: –“you are in this class” –“if you are in this class, you will get a grade” Let p = “you are in this class” Let q = “you will get a grade” By Modus Ponens, you can conclude that you will get a grade

3 Modus Ponens Consider (p  (p→q)) → q pqp→q p  (p→q))(p  (p→q)) → q TTTTT TFFFT FTTFT FFTFT

4 Modus Tollens Assume that we know: ¬q and p → q –Recall that p → q = ¬q → ¬p Thus, we know ¬q and ¬q → ¬p We can conclude ¬p

5 Modus Tollens example Assume you are given the following two statements: –“you will not get a grade” –“if you are in this class, you will get a grade” Let p = “you are in this class” Let q = “you will get a grade” By Modus Tollens, you can conclude that you are not in this class

6 Generalization & Specialization Generalization: If you know that p is true, then p  q will ALWAYS be true Specialization: If p  q is true, then p will ALWAYS be true

7 Example of proof We have the hypotheses: –“It is not sunny this afternoon and it is colder than yesterday” –“We will go swimming only if it is sunny” –“If we do not go swimming, then we will take a canoe trip” –“If we take a canoe trip, then we will be home by sunset” Does this imply that “we will be home by sunset”? –“It is not sunny this afternoon and it is colder than yesterday” –“We will go swimming only if it is sunny” –“If we do not go swimming, then we will take a canoe trip” –“If we take a canoe trip, then we will be home by sunset” Does this imply that “we will be home by sunset”? –“It is not sunny this afternoon and it is colder than yesterday” –“We will go swimming only if it is sunny” –“If we do not go swimming, then we will take a canoe trip” –“If we take a canoe trip, then we will be home by sunset” Does this imply that “we will be home by sunset”? –“It is not sunny this afternoon and it is colder than yesterday” –“We will go swimming only if it is sunny” –“If we do not go swimming, then we will take a canoe trip” –“If we take a canoe trip, then we will be home by sunset” Does this imply that “we will be home by sunset”? –“It is not sunny this afternoon and it is colder than yesterday” –“We will go swimming only if it is sunny” –“If we do not go swimming, then we will take a canoe trip” –“If we take a canoe trip, then we will be home by sunset” Does this imply that “we will be home by sunset”? –“It is not sunny this afternoon and it is colder than yesterday” –“We will go swimming only if it is sunny” –“If we do not go swimming, then we will take a canoe trip” –“If we take a canoe trip, then we will be home by sunset” Does this imply that “we will be home by sunset”? p q r s t ¬p  q¬p  q r → p ¬r → s s → t t

8 Example of proof 1.¬p  q1 st hypothesis 2.¬pSimplification using step 1 3.r → p2 nd hypothesis 4.¬rModus tollens using steps 2 & 3 5.¬r → s3 rd hypothesis 6.sModus ponens using steps 4 & 5 7.s → t 4 th hypothesis 8.tModus ponens using steps 6 & 7

9 So what did we show? We showed that: –[(¬p  q)  (r → p)  (¬r → s)  (s → t)] → t –That when the 4 hypotheses are true, then the implication is true –In other words, we showed the above is a tautology! To show this, enter the following into the truth table generator at ((~P ^ Q) ^ (R => P) ^ (~R => S) ^ (S => T)) => T

10 More rules of inference Conjunction: if p and q are true separately, then p  q is true Elimination: If p  q is true, and p is false, then q must be true Transitivity: If p→q is true, and q→r is true, then p→r must be true

11 Even more rules of inference Proof by division into cases: if at least one of p or q is true, then r must be true Contradiction rule: If ¬p→c is true, we can conclude p (via the contra-positive) Resolution: If p  q is true, and ¬p  r is true, then q  r must be true –Not in the textbook

12 Example of proof Given the hypotheses: –“If it does not rain or if it is not foggy, then the sailing race will be held and the lifesaving demonstration will go on” –“If the sailing race is held, then the trophy will be awarded” –“The trophy was not awarded” Can you conclude: “It rained”? (¬r  ¬f) → (s  l) s → t ¬t r

13 Example of proof 1.¬t3 rd hypothesis 2.s → t2 nd hypothesis 3.¬sModus tollens using steps 2 & 3 4.(¬r  ¬f)→(s  l)1 st hypothesis 5.¬(s  l)→¬(¬r  ¬f)Contrapositive of step 4 6.(¬s  ¬l)→(r  f)DeMorgan’s law and double negation law 7.¬s  ¬lAddition from step 3 8.r  fModus ponens using steps 6 & 7 9.rSimplification using step 8

14 Modus Badus Consider the following: Is this true? pqp→q q  (p→q))(q  (p→q)) → p TTTTT TFFFT FTTTF FFTFT Not a valid rule! Fallacy of affirming the conclusion

15 Modus Badus example Assume you are given the following two statements: –“you will get a grade” –“if you are in this class, you will get a grade” Let p = “you are in this class” Let q = “you will get a grade” You CANNOT conclude that you are in this class –You could be getting a grade for another class

16 Modus Badus Consider the following: Is this true? pqp→q ¬p  (p→q))(¬p  (p→q)) → ¬q TTTFT TFFFT FTTTF FFTTT Not a valid rule! Fallacy of denying the hypothesis

17 Modus Badus example Assume you are given the following two statements: –“you are not in this class” –“if you are in this class, you will get a grade” Let p = “you are in this class” Let q = “you will get a grade” You CANNOT conclude that you will not get a grade –You could be getting a grade for another class