Lecture 1.4: Rules of Inference CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Slides:

Advertisements

Similar presentations

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.

Advertisements

Announcements Grading policy No Quiz next week Midterm next week (Th. May 13). The correct answer to the quiz.

Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:

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

Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.

CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.

Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.

Logic 3 Tautological Implications and Tautological Equivalences

Copyright © Peter Cappello Logical Inferences Goals for propositional logic 1.Introduce notion of a valid argument & rules of inference. 2.Use inference.

Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.

3.6 Analyzing Arguments with Truth Tables

Lecture 3.1: Mathematical Induction CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.

1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.

MATH 224 – Discrete Mathematics

March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.

Discrete Mathematics CS 2610 August 24, Agenda Last class Introduction to predicates and quantifiers This class Nested quantifiers Proofs.

10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science

1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.

Discrete Structures (DS)

Lecture 1.2: Equivalences, and Predicate Logic* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren, Zeph.

Lecture 2.2: Set Theory* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.

From Truth Tables to Rules of Inference Using the first four Rules of Inference Modus Ponens, Modus Tollens, Hypothetical Syllogism and Disjunctive Syllogism.

1 Lecture 3.3: Recursion CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.

Discrete Mathematics. Predicates - the universal quantifier 11/28/2015 Suppose P(x) is a predicate on some universe of discourse. Ex. B(x) = “x is carrying.

1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,

Lecture 1.3: Predicate Logic CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

Lecture 2.2: Set Theory CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.

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.

What is Reasoning  Logical reasoning is the process of drawing conclusions from premises using rules of inference.  These inference rules are results.

Lecture 1.2: Equivalences, and Predicate Logic CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph.

Lecture 1.4: Rules of Inference, and Proof Techniques* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.

Lecture 1.3: Predicate Logic, and Rules of Inference* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.

Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.

Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.

CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway

9/29/2011Lecture Strong Induction1 Lecture 3.2: Strong Induction CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures.

9/27/2011 Lecture Mathematical Induction1 Lecture 3.1: Mathematical Induction* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from.

Lecture 1.5: Proof Techniques

Making Inferences with Propositions (Rules of Inference)

Lecture 1.2: Equivalences, and Predicate Logic

CSE15 Discrete Mathematics 01/30/17

Lecture 1.4: Rules of Inference

Discrete Mathematics.

Lecture 1.5: Proof Techniques

Rules of Inference Section 1.6.

Lecture 3.2: Induction and Strong Induction (contd.)

CS201: Data Structures and Discrete Mathematics I

Mathematical Reasoning

Lecture 3.2: Induction, and Strong Induction

CS 220: Discrete Structures and their Applications

Applied Discrete Mathematics Week 1: Logic

Lecture 3.2: Induction and Strong Induction (contd.)

Lecture 3.2: Induction, and Strong Induction

Inference Rules: Tautologies

Lecture 3.2: Induction, and Strong Induction

Lecture 1.6: Proof Techniques (contd)

Lecture 1.3: Predicate Logic

CS 250, Discrete Structures, Fall 2013

Lecture 3.1: Mathematical Induction

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

Lecture 1.6: Proof Techniques (contd)

CS 250, Discrete Structures, Fall 2014 Nitesh Saxena

Lecture 1.4: Rules of Inference

Mathematical Reasoning

CS201: Data Structures and Discrete Mathematics I

Lecture 3.1: Mathematical Induction

CS 250, Discrete Structures, Fall 2015 Nitesh Saxena

CS 250, Discrete Structures, Fall 2015 Nitesh Saxena

Lecture 1.3: Predicate Logic

Presentation transcript:

Lecture 1.4: Rules of Inference CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren

4/21/2015Lecture Rules of Inference2 Course Admin Slides from previous lectures all posted Expect HW1 to be coming in around coming Monday Questions?

4/21/2015Lecture Rules of Inference3 Outline Rules of Inference

4/21/2015Lecture Rules of Inference4 Proofs – How do we know? The following statements are true: If I am Mila, then I am a great swimmer. I am Mila. What do we know to be true? I am a great swimmer! How do we know it?

4/21/2015Lecture Rules of Inference5 Proofs – How do we know? A theorem is a statement that can be shown to be true. A proof is the means of doing so. Given set of true statements or previously proved theorems Rules of inference Proof

What rules we study 1. Modus Ponens 2. Modus Tollens 3. Addition 4. Simplification 5. Disjunctive Syllogism 6. Hypothetical Syllogism 4/21/2015Lecture Rules of Inference6

4/21/2015Lecture Rules of Inference7 Proofs – How do we know? The following statements are true: If I have taken MA 106, then I am allowed to take CS 250 I have taken MA 106 What do we know to be true? I am allowed to take CS 250 What rule of inference can we use to justify it?

4/21/2015Lecture Rules of Inference8 Rules of Inference – Modus Ponens I have taken MA 106. If I have taken MA 106, then I am allowed to take CS 250.  I am allowed to take CS 250. p p  q  q Tautology: (p  (p  q))  q Inference Rule: Modus Ponens

4/21/2015Lecture Rules of Inference9 Rules of Inference – Modus Tollens I am not allowed to take CS 250. If I have taken MA 106, then I am allowed to take CS 250.  I have not taken MA 106.  q p  q  p p Tautology: (  q  (p  q))   p Inference Rule: Modus Tollens

4/21/2015Lecture Rules of Inference10 Rules of Inference – Addition I am not a great skater.  I am not a great skater or I am tall. p  p  q Tautology: p  (p  q) Inference Rule: Addition

4/21/2015Lecture Rules of Inference11 Rules of Inference – Simplification I am not a great skater and you are sleepy.  you are sleepy. p  q  p Tautology: (p  q)  p Inference Rule: Simplification

4/21/2015Lecture Rules of Inference12 Rules of Inference – Disjunctive Syllogism I am a great eater or I am a great skater. I am not a great skater.  I am a great eater! p  q  q  p Tautology: ((p  q)   q)  p Inference Rule: Disjunctive Syllogism

4/21/2015Lecture Rules of Inference13 Rules of Inference – Hypothetical Syllogism If you are an athlete, you are always hungry. If you are always hungry, you have a snickers in your backpack.  If you are an athlete, you have a snickers in your backpack. p  q q  r  p  r Tautology: ((p  q)  (q  r))  (p  r) Inference Rule: Hypothetical Syllogism

4/21/2015Lecture Rules of Inference14 Examples Amy is a computer science major.  Amy is a math major or a computer science major. Addition If Ernie is a math major then Ernie is geeky. Ernie is not geeky!  Ernie is not a math major. Modus Tollens

4/21/2015Lecture Rules of Inference15 Complex Example: Rules of Inference Here’s what you know: Ellen is a math major or a CS major. If Ellen does not like discrete math, she is not a CS major. If Ellen likes discrete math, she is smart. Ellen is not a math major. Can you conclude Ellen is smart? M  C  D   C D  S MM

4/21/2015Lecture Rules of Inference16 Complex Example: Rules of Inference 1. M  CGiven 2.  D   CGiven 3. D  SGiven 4.  MGiven 5. CDS (1,4) 6. DMT (2,5) 7. SMP (3,6) Ellen is smart!

4/21/2015Lecture Rules of Inference17 Rules of Inference: Common Fallacies Rules of inference, appropriately applied give valid arguments. Mistakes in applying rules of inference are called fallacies.

4/21/2015Lecture Rules of Inference18 Rules of Inference: Common Fallacies If I am Bonnie Blair, then I skate fast I skate fast!  I am Bonnie Blair Nope If you don’t give me $10, I bite your ear. I bite your ear!  You didn’t give me $10. Nope ((p  q)  q)  p Not a tautology.

4/21/2015Lecture Rules of Inference19 Rules of Inference: Common Fallacies If it rains then it is cloudy. It does not rain.  It is not cloudy Nope If it is a car, then it has 4 wheels. It is not a car.  It doesn’t have 4 wheels. Nope ((p  q)   p)   q Not a tautology.

4/21/2015Lecture Rules of Inference20 Today’s Reading Rosen 1.6 Please start solving the exercises at the end of each chapter section. They are fun.