Rules of Inference Dr. Yasir Ali.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
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.
Lab 2 - CA Chapter 1 Section 1.5
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
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.
Logic 3 Tautological Implications and Tautological Equivalences
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Through the Looking Glass, 1865
Copyright © Peter Cappello Logical Inferences Goals for propositional logic 1.Introduce notion of a valid argument & rules of inference. 2.Use inference.
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.
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Propositional Logic.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
Copyright © Curt Hill Rules of Inference What is a valid argument?
Propositional Proofs 2.
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
Valid and Invalid Arguments
CS 103 Discrete Structures Lecture 07b
Section 3.5 Symbolic Arguments
Reason and Argument Chapter 6 (2/3). A symbol for the exclusive ‘or’ We will use ұ for the exclusive ‘or’ Strictly speaking, this connective is not necessary.
March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Discrete Structures (DS)
Deductive Arguments.
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.
Valid and Invalid Arguments
LOGIC.
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.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
Copyright © Cengage Learning. All rights reserved.
Dilemma: Division Into Cases Dilemma: p  q p  r q  r  r Premises:x is positive or x is negative. If x is positive, then x 2 is positive. If x is negative,
Logic: The Language of Philosophy. What is Logic? Logic is the study of argumentation o In Philosophy, there are no right or wrong opinions, but there.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Valid and Invalid Arguments
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
Demonstrating the validity of an argument using syllogisms.
Proof Techniques.
Rules of Inference Section 1.6.
Copyright © Cengage Learning. All rights reserved.
Principles of Computing – UFCFA3-30-1
CS201: Data Structures and Discrete Mathematics I
Mathematical Reasoning
Section 3.5 Symbolic Arguments
3.5 Symbolic Arguments.
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Discrete Mathematics Logic.
Valid and Invalid Arguments
Mathematical Reasoning
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
Presentation transcript:

Rules of Inference Dr. Yasir Ali

Syllogism An argument form consisting of two premises and a conclusion is called a syllogism. The first and second premises are called the major premise and minor premise, respectively.

Modus Ponens The most famous form of valid syllogism in logic is called modus ponens. It has the following form: Following argument form is valid. If the sum of the digits of 371,487 is divisible by 3, then 371,487 is divisible by 3. The sum of the digits of 371,487 is divisible by 3. Therefore, 371,487 is divisible by 3. p q p →q T F

Modus Tollens Another valid argument form called modus tollens. It has the following form: If p then q. ¬ q ∴ ¬ p Following argument form is valid. If the watch-dog detects an intruder, the dog will bark. The dog did not bark. Therefore, no intruder was detected by the watch-dog. p q p →q ¬q ¬p T F

Additional Valid Argument Forms: Rules of Inference Generalization: The following argument forms are valid. Following argument form is valid. “It is below freezing now”, therefore, “It is below freezing now” or “It is raining now.” Or simply, It is below freezing now, therefore, it is below freezing or raining now. Also, It is raining now, therefore, it is below freezing or raining now.

Specialization: The following argument forms are valid. Following argument form is valid. “It is below freezing now,” and “It is raining now”, therefore, it is below freezing now. Or simply, It is below freezing and raining now, therefore it is below freezing now. Also, It is below freezing and raining now, therefore it is raining now.

Elimination: The following argument forms are valid. Following argument form is valid. It rains today or we will have a barbecue today. We won’t have barbecue today, therefore, it is raining today. Also, It rains today or we will have a barbecue today. It is not raining today, therefore, we won’t have barbecue today.

Transitivity: The following argument forms are valid. Following argument form is valid. If it rains today, then we will not have a barbecue today. If we do not have a barbecue today, then we will have a barbecue tomorrow. Therefore, if it rains today, then we will have a barbecue tomorrow.

Fallacies A fallacy is an error in reasoning that results in an invalid argument. Consider the following argument form: If Zeke is a cheater, then Zeke sits in back row. Zeke sits in the back row, therefore Zeke is a cheater. The above argument has the form: Which is not a valid argument form, this error in reasoning is known as converse error. p q p →q T F

Consider the following argument: If interest rates are going up, stock market prices will go down. Interest rates are not going up. Therefore, stock market prices will not go down. This is an invalid argument form, and the error in reasoning is known as inverse error. p q p →q ¬p ¬q T F

Rules of Inference Rule of Inference Tautology Name p p → q ∴ q Modus ponens ¬q p → q ∴ ¬p (¬q ∧ (p → q))→¬p Modus tollens p → q q → r ∴ p → r ((p → q) ∧ (q → r)) → (p → r ) Hypothetical syllogism p ∨ q ¬p ∴ q ((p ∨ q)∧¬p) → q Disjunctive syllogism ∴ p ∨ q p → (p ∨ q) Addition p ∧ q ∴ p (p ∧ q) → p Simplification q ∴ p ∧ q ((p) ∧ (q)) → (p ∧ q) Conjunction ¬p ∨ r ∴ q ∨ r ((p ∨ q) ∧ (¬p ∨ r)) → (q ∨ r) Resolution

Example: Show that the premises “If you send me an e-mail message, then I will finish writing the program,” “If you do not send me an e-mail message, then I will go to sleep early,” and “If I go to sleep early, then I will wake up feeling refreshed” lead to the conclusion “If I do not finish writing the program, then I will wake up feeling refreshed.” Let p :“You send me an e-mail message,” q :“I will finish writing the program,” r :“I will go to sleep early,” and s :“I will wake up feeling refreshed.” Then the argument takes the form p → q, ¬p → r, r → s Therefore ¬q → s.

For each of these sets of premises, what relevant conclusion or conclusions can be drawn? Explain the rules of inference used to obtain each conclusion from the premises. a) “If I play hockey, then I am sore the next day.” “I use the whirlpool if I am sore.” “I did not use the whirlpool.” b) “All insects have six legs.” “Dragonflies are insects.” “Spiders do not have six legs.” “Spiders eat dragonflies.” c) “Every student has an Internet account.” “Homer does not have an Internet account.” “Maggie has an Internet account.” d) “All foods that are healthy to eat do not taste good.” “Tofu is healthy to eat.” “You only eat what tastes good.” “You do not eat tofu.” “Cheeseburgers are not healthy to eat.” e ) “I am either dreaming or hallucinating.” “I am not dreaming.” “If I am hallucinating, I see elephants running down the road.”

A set of premises and a conclusion are given A set of premises and a conclusion are given. Use the valid argument forms (rules of inference) to deduce the conclusion from the premises, giving a reason for each step. Assume all variables are statement variables. p →q r ∨ s ¬ s → ¬ t ¬ q ∨ s ¬ s ¬ p ∧ r → u w ∨ t ∴ u ∧ w

Given the following information about a computer program, find the mistake in the program. There is an undeclared variable or there is a syntax error in the first five lines. If there is a syntax error in the first five lines, then there is a missing semicolon or a variable name is misspelled. There is not a missing semicolon. There is not a misspelled variable name.