Valid and Invalid Arguments

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.
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.
1 Valid and Invalid Arguments CS 202 Epp Section 1.3 Aaron Bloomfield.
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
CS 202 Rosen section 1.5 Aaron Bloomfield
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Copyright © Curt Hill Rules of Inference What is a valid argument?
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.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
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.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
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.
Proof Review CS 202 Aaron Bloomfield Spring 2007.
CSci 2011 Discrete Mathematics Lecture 5 CSci 2011.
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
2. The Logic of Compound Statements Summary
Advanced Algorithms Analysis and Design
Methods of Proof Aaron Bloomfield.
Discrete Mathematics Lecture 1 Logic of Compound Statements
CSE15 Discrete Mathematics 01/30/17
In this slide set… Rules of inference for propositions
Discrete Mathematics Logic.
Discrete Mathematics.
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
Methods of proof Section 1.6 & 1.7 Wednesday, June 20, 2018
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
Proof Techniques.
Rules of Inference Section 1.6.
Module #10: Proof Strategies
CS100: Discrete structures
Information Technology Department
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
Section 3.5 Symbolic Arguments
3.5 Symbolic Arguments.
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
Propositional Logic.
Inference Rules: Tautologies
Discrete Mathematics Logic.
Information Technology Department SKN-SITS,Lonavala.
Module #10: Proof Strategies
COMP 1380 Discrete Structures I Thompson Rivers University
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Mathematical Reasoning
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

Valid and Invalid Arguments CS 202 Epp Section 1.3

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

Modus Ponens Consider (p  (p→q)) → q p q p→q p(p→q)) (p(p→q)) → q T F

Foundation of Proof by Contradiction 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 Foundation of Proof by Contradiction

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

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

Example of proof 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”? 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”? p q r s t ¬p  q r → p ¬r → s s → t t

Example of proof ¬p  q 1st hypothesis ¬p Simplification using step 1 r → p 2nd hypothesis ¬r Modus tollens using steps 2 & 3 ¬r → s 3rd hypothesis s Modus ponens using steps 4 & 5 s → t 4th hypothesis t Modus ponens using steps 6 & 7

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 http://sciris.shu.edu/~borowski/Truth/: ((~P ^ Q) ^ (R => P) ^ (~R => S) ^ (S => T)) => T

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

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

Example of proof Given the hypotheses: Can you conclude: “It rained”? “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

Example of proof ¬t 3rd hypothesis s → t 2nd hypothesis ¬s Modus tollens using steps 2 & 3 (¬r¬f)→(sl) 1st hypothesis ¬(sl)→¬(¬r¬f) Contrapositive of step 4 (¬s¬l)→(rf) DeMorgan’s law and double negation law ¬s¬l Addition from step 3 rf Modus ponens using steps 6 & 7 r Simplification using step 8

Fallacy of affirming the conclusion Modus Phonens Fallacy of affirming the conclusion a.k.a. Converse Error Consider the following: Is this true? p q p→q q(p→q)) (q(p→q)) → p T F Not a valid rule!

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

Fallacy of denying the hypothesis Modus Failens Fallacy of denying the hypothesis a.k.a. Inverse Error Consider the following: Is this true? p q p→q ¬p(p→q)) (¬p(p→q)) → ¬q T F Not a valid rule!

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