CS 2336 Discrete Mathematics

Similar documents
Rules of Inference. Arguments and Validity

Rules Build Arguments Rules Building Arguments

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

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

Readings: Conjecture. Theorem. Rosen Section 1.5

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

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

Review: Potential stumbling blocks

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

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

Discrete Structures for Computer Science

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

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

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

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

Agenda. Introduction to Proofs Dr Patrick Chan School of Computer Science and Engineering South China University of Technology

Intro to Logic and Proofs

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

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

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

ECOM Discrete Mathematics

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

Rules of Inference. Agenda. Rules of Inference Dr Patrick Chan. p r. p q. q r. Rules of Inference for Quantifiers. Hypothetical Syllogism

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

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

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

software design & management Gachon University Chulyun Kim

DISCRETE MATHEMATICS BA202

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

CS0441 Discrete Structures Recitation 3. Xiang Xiao

Chapter 4, Logic using Propositional Calculus Handout

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Predicate Logic. Andreas Klappenecker

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

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

ICS141: Discrete Mathematics for Computer Science I

(Refer Slide Time: 02:20)

Logic and Proof. Aiichiro Nakano

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Solutions to Exercises (Sections )

1 The Foundation: Logic and Proofs

PROPOSITIONAL CALCULUS

1 The Foundation: Logic and Proofs

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

Predicate Logic & Quantification

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

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

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

Inference and Proofs (1.6 & 1.7)

For a horseshoe statement, having the matching p (left side) gives you the q (right side) by itself. It does NOT work with matching q s.

Logic - recap. So far, we have seen that: Logic is a language which can be used to describe:

Reexam in Discrete Mathematics

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

Manual of Logical Style

A. Propositional Logic

CSC 125 :: Final Exam May 3 & 5, 2010

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

Analyzing Arguments with Truth Tables

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

Announcements. Exam 1 Review

PHI Propositional Logic Lecture 2. Truth Tables

CSE 20 DISCRETE MATH. Winter

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

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

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

CSE 20 DISCRETE MATH. Fall

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.

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

Discrete Mathematics

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

Full file at Chapter 1

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.

Review. p q ~p v q Contrapositive: ~q ~p Inverse: ~p ~q Converse: q p

Math 55 Homework 2 solutions

THE LOGIC OF COMPOUND STATEMENTS

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

[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics

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

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

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

SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY MA DISCRETE MATHEMATICS

Math 3336: Discrete Mathematics Practice Problems for Exam I

COMP232 - Mathematics for Computer Science

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

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

First order Logic ( Predicate Logic) and Methods of Proof

Chapter 3. The Logic of Quantified Statements

MAT 243 Test 1 SOLUTIONS, FORM A

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

The Logic of Compound Statements cont.

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

A Quick Lesson on Negation

Deductive and Inductive Logic

CS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration

CPSC 121: Models of Computation

10/13/15. Proofs: what and why. Proposi<onal Logic Proofs. 1 st Proof Method: Truth Table. A sequence of logical arguments such that:

Discrete Mathematics for CS Spring 2006 Forbes HW 1 Solutions

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

Where are my glasses?

Transcription:

CS 2336 Discrete Mathematics Lecture 3 Logic: Rules of Inference 1

Outline Mathematical Argument Rules of Inference 2

Argument In mathematics, an argument is a sequence of propositions (called premises) followed by a proposition (called conclusion) A valid argument is one that, if all its premises are true, then the conclusion is true Ex: If it rains, I drive to school. It rains. I drive to school. 3

Valid Argument Form In the previous example, the argument belongs to the following form: p q p q Indeed, the above form is valid no matter what propositions are substituted to the variables This is called a valid argument form 4

Valid Argument Form By definition, if a valid argument form consists premises: p 1, p 2,, p k conclusion: q then ( p 1 p 2 p k ) q is a tautology Ex: ( ( p q ) p ) q is a tautology Some simple valid argument forms, called rules of inference, are derived and can be used to construct complicated argument form 5

Rules of Inference 1. Modus Ponens (method of affirming) premises: p, p q conclusion: q 2. Modus Tollens (method of denying) premises: q, p q conclusion: p 6

Rules of Inference 3. Hypothetical Syllogism premises: p q, q r conclusion: p r 4. Disjunctive Syllogism premises: p, p q conclusion: q 7

Rules of Inference 5. Addition premises: conclusion: p p q 6. Simplification premises: p q conclusion: p 8

Rules of Inference 7. Conjunction premises: conclusion: 8. Resolution premises: conclusion: p, q p q p q, p r q r 9

Rules of Inference with Quantifiers 9. Universal Instantiation premises: x P(x ) conclusion: P(c), for any c 10. Universal Generalization premises: P(c) for any arbitrary c conclusion: x P(x ) 10

Rules of Inference with Quantifiers 11. Existential Instantiation premises: x P(x ) conclusion: P(c), for some element c 12. Existential Generalization premises: P(c) for some element c conclusion: x P(x ) 11

Applying Rules of Inferences Example 1: It is known that 1. It is not sunny this afternoon, and it is colder than yesterday. 2. We will go swimming only if it is sunny. 3. If we do not go swimming, we will play basketball. 4. If we play basketball, we will go home early. Can you conclude we will go home early? 12

Solution To simplify the discussion, let p := It is sunny this afternoon q := It is colder than yesterday r := We will go swimming s := We will play basketball t := We will go home early We will give a valid argument with premises: p r, r p, r s, s t conclusion: t 13

Solution Step Reason 1. p r Premise 2. p Simplification using (1) 3. r p Premise 4. r Modus Tollens using (2) and (3) 5. r s Premise 6. s Modus Ponens using (4) and (5) 7. s t Premise 8. t Modus Ponens using (6) and (7) 14

Applying Rules of Inferences Example 2: It is known that 1. If you send me an email, then I will finish my program. 2. If you do not send me an email, then I will go to sleep early. 3. If I go to sleep early, I will wake up refreshed. Can you conclude If I do not finish my program, then I will wake up refreshed? 15

Solution To simplify the discussion, let p := You send me an email q := I finish my program r := I go to sleep early s := I wake up refreshed We will give a valid argument with premises: p q, p r, r s conclusion: q s 16

Solution Step Reason 1. p q Premise 2. q s Contrapositive of (1) 3. p r Premise 4. q r Hypothetical Syllogism by (2) and (3) 5. r s Premise 6. q s Modus Ponens by (4) and (5) 17

Applying Rules of Inferences Example 3: It is known that 1. A student in this class has not read the book. 2. Everyone in this class passed the first exam. Can you conclude that Someone who passed the first exam has not read the book? 18

Solution To simplify the discussion, let C(x ) := x is a student in the class B(x ) := x has read the book P(x ) := x passed the first exam We will give a valid argument with premises: x ( C(x ) B(x ) ), x ( C(x ) P(x ) ) conclusion: x ( P(x ) B(x ) ) 19

Solution Step Reason 1. x ( C(x ) B(x ) ) Premise 2. C(a) B(a) Existential Instantiation 3. C(a) Simplification by (2) 4. x ( C(x ) P(x ) ) Premise 5. C(a) P(a) Universal Instantiation 6. P(a) Modus Ponens by (3) and (5) 7. B(a) Simplification by (2) 8. P(a) B(a) Conjunction by (6) and (7) 9. x ( P(x ) B(x ) ) Existential Generalization 20

From Sherlock Holmes The following is from Silver Blaze, one of Sherlock Holmes stories (written by Sir Arthur Conan Doyle): Gregory: Is there any other point to which you would wish to draw my attention? Holmes: To the curious incident of the dog in the night-time. Gregory: The dog did nothing in the night-time. Holmes: That was the curious incident. 21