Outline. Rules of Inferences Discrete Mathematics I MATH/COSC 1056E. Example: Existence of Superman. Outline

Similar documents
CS 2336 Discrete Mathematics

Rules of Inference. Arguments and Validity

Rules Build Arguments Rules Building Arguments

KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Readings: Conjecture. Theorem. Rosen Section 1.5

Predicate Logic. Andreas Klappenecker

1 The Foundation: Logic and Proofs

PROPOSITIONAL CALCULUS

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

1 The Foundation: Logic and Proofs

Full file at

Analyzing Arguments with Truth Tables

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

CSCE 222 Discrete Structures for Computing. Predicate Logic. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

software design & management Gachon University Chulyun Kim

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

ICS141: Discrete Mathematics for Computer Science I

Discrete Structures for Computer Science

Mat2345 Week 2. Chap 1.5, 1.6. Fall Mat2345 Week 2. Chap 1.5, 1.6. Week2. Negation. 1.5 Inference. Modus Ponens. Modus Tollens. Rules.

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

Logic Overview, I. and T T T T F F F T F F F F

CSE 20 DISCRETE MATH. Winter

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

Math 55 Homework 2 solutions

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Methods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

Mathacle. PSet ---- Algebra, Logic. Level Number Name: Date: I. BASICS OF PROPOSITIONAL LOGIC

Predicate Logic & Quantification

Logic and Proof. Aiichiro Nakano

Sec$on Summary. Valid Arguments Inference Rules for Propositional Logic. Inference Rules for Quantified Statements. Building Arguments

CSE 20 DISCRETE MATH. Fall

Review: Potential stumbling blocks

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

Section 1.2: Propositional Logic

Manual of Logical Style

Sec$on Summary. Valid Arguments Inference Rules for Propositional Logic. Inference Rules for Quantified Statements. Building Arguments

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Solutions to Exercises (Sections )

Discrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

The Logic of Compound Statements cont.

The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

(Refer Slide Time: 02:20)

Intro to Logic and Proofs

Review for Midterm 1. Andreas Klappenecker

DISCRETE MATHEMATICS BA202

Discrete Mathematics

A. Propositional Logic

Chapter 1: The Logic of Compound Statements. January 7, 2008

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

HANDOUT AND SET THEORY. Ariyadi Wijaya

Inference and Proofs (1.6 & 1.7)

PHI Propositional Logic Lecture 2. Truth Tables

CSC Discrete Math I, Spring Propositional Logic

CS0441 Discrete Structures Recitation 3. Xiang Xiao

Section 1.1 Propositions

2. Use quantifiers to express the associative law for multiplication of real numbers.

Collins' notes on Lemmon's Logic

Math.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference

ECOM Discrete Mathematics

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Discrete Mathematical Structures: Theory and Applications

With Question/Answer Animations. Chapter 1, Part III: Proofs

Chapter 4, Logic using Propositional Calculus Handout

Propositional Logic. Spring Propositional Logic Spring / 32

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Logic and Set Notation

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Chapter 3. The Logic of Quantified Statements

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

First order Logic ( Predicate Logic) and Methods of Proof

MAT 243 Test 1 SOLUTIONS, FORM A

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Test 1 Solutions(COT3100) (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology:

Supplementary Logic Notes CSE 321 Winter 2009

Logic, Sets, and Proofs

THE LOGIC OF COMPOUND STATEMENTS

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

COMP232 - Mathematics for Computer Science

Mathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

Announcements. Exam 1 Review

Deductive and Inductive Logic

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

Transcription:

Outline s Discrete Mathematics I MATH/COSC 1056E Julien Dompierre Department of Mathematics and Computer Science Laurentian University Sudbury, August 6, 2008 Using to Build Arguments and Quantifiers Outline Example: Existence of Superman Using to Build Arguments and Quantifiers If Superman were able and willing to prevent evil, then he would so. If Superman were unable to prevent evil, then he would be impotent; if he were unwilling to prevent evil, then he would be malevolent. Superman does not prevent evil. If Superman exists, he is neither impotent nor malevolent. Therefore, Superman does not exist. Is this argument valid?

Outline Using to Build Arguments and Quantifiers By an argument, we mean a sequence of statements that ends with a conclusion. The conclusion is the last statement of the argument. The premises are the statements of the argument preceding the conclusion. By a valid argument, we mean that the conclusion must follow from the truth of the premises. Rule of Inference Notation Some tautologies are rules of inference. The general form of a rule of inference is where p i are the premises and c is the conclusion. (p 1 p 2 p n ) c A rule of inference is written as p 1 p 2. p n c where the symbol denotes therefore. Using this notation, the hypotheses are written in a column, followed by a horizontal bar, followed by a line that begins with the therefore symbol and ends with the conclusion.

Outline modus ponens Using to Build Arguments and Quantifiers p q p q is denoted the law of detachment or modus ponens (Latin for mode that affirms). If a conditional statement and the hypothesis of the conditional statement are both true, therefore the conclusion must also be true. The basis of the modus ponens is the tautology ((p q) p) q. modus ponens Example of modus ponens p q p q p (p q) (p (p q)) q T T T T T T F F F T F T T F T F F T F T If it rains, then it is cloudy. It rains. Therefore, it is cloudy. r is the proposition it rains. c is the proposition it is cloudy. r c r c

modus tollens modus tollens p q q p is denoted the modus tollens (Latin for mode that denies). This rule of inference is based on the contrapositive. The basis of the modus ponens is the tautology p q p q q (p q) q p ((p q) q) p T T T F F F T T F F T F F T F T T F F T T F F T T T T T ((p q) q) p. Example of modus tollens The Addition If it rains, then it is cloudy. It is not cloudy. Therefore, it is not the case that it rains. r is the proposition it rains. c is the proposition it is cloudy. r c c r is the rule of addition. p p q p (p q).

The Simplification The Hypothetical Syllogism is the rule of simplification. p q p (p q) p. p q q r p r is the rule of hypothetical syllogism (syllogism means argument made of three propositions where the last one, the conclusion, is necessarily true if the two firsts, the hypotheses, are true ). ((p q) (q r)) (p r). The Disjunctive Syllogism The Conjunction p q p q p q p q is the rule of disjunctive syllogism. ((p q) p) q. is the rule of conjunction. ((p) (q)) (p q).

The Resolution Outline is the rule of resolution. p q p r q r ((p q) ( p r)) (q r). Using to Build Arguments and Quantifiers The Fallacy of Affirming the Conclusion The wrong rule of inference are incorrect arguments. resemble rules of inference but are based on contingencies rather than tautologies. p q q p is denoted the fallacy of affirming the conclusion. The basis of this fallacy is the contingency (q (p q)) p that is a misuse of the modus ponens and is not a tautology.

Fallacy of Affirming the Conclusion Example of the Fallacy of Affirming the Conclusion p q p q q (p q) (q (p q)) p T T T T T T F F F T F T T T F F F T F T If it rains, then it is cloudy. It is cloudy. Therefore, it rains (wrong). r is the proposition it rains. c is the proposition it is cloudy. r c c r (wrong) The Fallacy of Denying the Hypothesis Fallacy of Denying the Hypothesis The wrong rule of inference p q p q is denoted the fallacy of denying the hypothesis. The basis of this fallacy is the contingency ( p (p q)) q p q p q p (p q) p q ((p q) p) q T T T F F F T T F F F F T T F T T T T F F F F T T T T T that is a misuse of the modus tollens and is not a tautology.

Example of the Fallacy of Denying the Hypothesis Outline If it rains, then it is cloudy. It is not the case that it rains. Therefore, it is not cloudy (wrong). r is the proposition it rains. c is the proposition it is cloudy. r c r c (wrong) Using to Build Arguments and Quantifiers Example: Existence of Superman Example: Existence of Superman If Superman were able and willing to prevent evil, then he would so. If Superman were unable to prevent evil, then he would be impotent; if he were unwilling to prevent evil, then he would be malevolent. Superman does not prevent evil. If Superman exists, he is neither impotent nor malevolent. Therefore, Superman does not exist. w is Superman is willing to prevent evil a is Superman is able to prevent evil i is Superman is impotent m is Superman is malevolent p is Superman prevents evil x is Superman exists If Superman were able and willing to prevent evil, then he would so. If Superman were unable to prevent evil, then he would be impotent; if he were unwilling to prevent evil, then he would be malevolent. Superman does not prevent evil. If Superman exists, he is neither impotent nor malevolent. Therefore, Superman does not exist. h1. (a w) p h2. a i h3. w m h4. p h5. x i h6. x m

Example: Existence of Superman Outline Argument: 1. i a contrapositive of h 2. 2. x a h 5 and step 1 with hyp. syll. 3. m w contrapositive of h 3. 4. x w h 6 ans step 3 with hyp. syll. 5. x (a w) Step 2 and 4 with conjunction. 6. x p Step 5 and h 1 with hyp. syll. 7. x Step 6 and h 4 with modus tollens. Using to Build Arguments and Quantifiers Q.E.D. and Quantifiers Universal Instantiation There are four rules of inference for quantifiers: Universal instantiation (UI), Universal generalization (UG), Existential instantiation (EI), Existential generalization (EG). x P(x) P(c) If a propositional function is true for all element x of the universe of discourse, then it is true for a particular element c of the universe of discourse.

Universal Instantiation and modus ponens Universal Generalization The universal instantiation and the modus ponens are used together to form the universal modus ponens. Example: All humans have two legs. John Smith is a human. Therefore, John Smith has two legs. H(x) is x is a human. L(x) is x has two legs. j is John Smith, a element of the universe of discourse. 1. x (H(x) L(x)) Premise. 2. H(j) L(j) Universal instantiation from 1. 3. H(j) Premise. L(j) Modus ponens from 2. et 3. P(c) for an arbitrary c x P(x) We must first define the universe of discourse. Then, we must show that P(c) is true for an arbitrary, and not a specific, element c of the universe of discourse. We have no control over c and we can not make any other assumptions about c other than it comes from the domain of discourse. The error of adding unwarranted assumptions about the arbitrary element c is common and is an incorrect reasoning. Existential Instantiation Existential Generalization x P(x) P(c) for some element c The existential instantiation is the rule that allow us to conclude that there is an element c in the universe of discourse for which P(c) is true if we know that xp(x) is true. We can not select an arbitrary value of c here, but rather it must be a c for which P(c) is true. P(c) for some element c x P(x) If we know one element c in the universe of discourse for which P(c) is true, therefore we know that x P(x) is true.