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

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

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.
February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers Example: Add a = (1110) 2 and b = (1011) 2. a 0 + b.
Introduction to Theorem Proving
CPSC 121: Models of Computation Unit 6 Rewriting Predicate Logic Statements Based on slides by Patrice Belleville and Steve Wolfman.
Logic Use mathematical deduction to derive new knowledge.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
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.
Use a truth table to determine the validity or invalidity of this argument. First, translate into standard form “Martin is not buying a new car, since.
CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.
CS128 – Discrete Mathematics for Computer Science
Logic 3 Tautological Implications and Tautological Equivalences
CSE (c) S. Tanimoto, 2008 Propositional Logic
Laws of , , and  Excluded middle law Contradiction law P   P  T P   P  F NameLaw Identity laws P  F  P P  T  P Domination laws P  T  T P.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Validity: Long and short truth tables Sign In! Week 10! Homework Due Review: MP,MT,CA Validity: Long truth tables Short truth table method Evaluations!
February 25, 2002Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers How do we (humans) add two integers? Example: 7583.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Inference is a process of building a proof of a sentence, or put it differently inference is an implementation of the entailment relation between sentences.
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.
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.
Mathematical Structures for Computer Science Chapter 1.2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
F22H1 Logic and Proof Week 6 Reasoning. How can we show that this is a tautology (section 11.2): The hard way: “logical calculation” The “easy” way: “reasoning”
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
Natural Deduction Proving Validity. The Basics of Deduction  Argument forms are instances of deduction (true premises guarantee the truth of the conclusion).
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
2. 1. G > T 2. (T v S) > K / G > K (G v H) > (S. T) 2. (T v U) > (C. D) / G > C A > ~(A v E) / A > F H > (I > N) 2. (H > ~I) > (M v N)
Proof Tactics, Strategies and Derived Rules CS 270 Math Foundations of CS Jeremy Johnson.
Decimal Operations Objective: To solve decimal problems correctly by using the correct place values.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
Introduction to Logic Lecture 13 An Introduction to Truth Tables By David Kelsey.
Today’s Topics Argument forms and rules (review)
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
Theorems and Shortcuts Kareem Khalifa Department of Philosophy Middlebury College.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Deductive Reasoning. Inductive: premise offers support and evidenceInductive: premise offers support and evidence Deductive: premises offers proof that.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Lecture 1.4: Rules of Inference
Formal Logic CSC 333.
Natural Deduction: Using simple valid argument forms –as demonstrated by truth-tables—as rules of inference. A rule of inference is a rule stating that.
Demonstrating the validity of an argument using syllogisms.
6.1 Symbols and Translation
Methods for Evaluating Validity
A v B ~ A B > C ~C B > (C . P) B / ~ B mt 1,2 / B ds 1,2
7.1 Rules of Implication I Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Deductive Reasoning: Propositional Logic
Hurley … Chapter 6.5 Indirect Truth Tables
CS 270 Math Foundations of CS
CS 220: Discrete Structures and their Applications
Inference Rules: Tautologies
The Method of Deduction
Malini Sen WESTERN LOGIC Presented by Assistant Professor
Natural Deduction Hurley, Logic 7.1.
Lecture 1.4: Rules of Inference
Natural Deduction Hurley, Logic 7.3.
Divisibility tests These are simple tricks to test what a number can be shared by . We are going to learn tricks for testing if a number can be shared.
Chapter 8 Natural Deduction
The Main Connective (Again)
Presentation transcript:

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

The First Four Rules of Inference These rules have lines that proceed from what is true, what appears in a “proof” or “derivation”, to what is new under the line. The first two lines in each of these are “given”, already assumed to be true, already appearing in a proof or derivation.

In each rule: Think of the p and q as placeholders for a “part” of a sentence. For example, the p is the first part of a horseshoe sentence, the q is the second part. This Modus Ponens (MP) rule can be applied to sentences with complex parts: (A v B) ⊃ (C v D) A v B C v D Always remember that the P is the whole first part of the horseshoe, and the Q is the whole second part of the horseshoe.

Example: In this proof, the MP rule is being used on a horseshoe that has a complex second part. Always start by seeing what you have in your givens (the first lines you see) and then work your way into the problem by asking which Rule of Inference you can use on that particular problem. Let’s take it step by step:

When you first see a problem, it will look like this: You’ll see the numbered lines, which are the “givens”, and a slash / Your goal is to have what is behind the slash on a new line of its own, after applying Rules of Inference. So the first thing you should note is that the first line is a horseshoe, and the second line is repeating the first part of the horseshoe: The ~C.

Looking for types of sentences and their parts in the lines you have: Whenever you have a line in the proof that has a horseshoe, and another line that is the first part of the horseshoe repeated all by itself, you can do a Modus Ponens! To do this Modus Ponens (MP) correctly, be sure to write the whole second part of the horseshoe on line 1 on a new line of its own, noting that it came from lines 1 and 2 by MP. That’s 3. A ⊃ C 1,2 MP

Remember, the final goal… The final goal is what is behind the slash, the / ~A So to finish the proof, evaluate what you have in your lines again, including the new line 3: You’ll notice that lines 2 and 3 can be used to make a Modus Tollens (MT), the second Rule of Inference in 7.1!

Modus Tollens (MT) In Modus Tollens, we have a horseshoe sentence on a line, and on some other line, we have a negation in front of the second half of the horseshoe. We can then write on a new line a negation in front of the first half of the horseshoe!

What should we write next?

~A With the line number 4, followed by lines 2,3 MT 4. ~A 2,3 MT

Here’s an example of Hypothetical Syllogism, HS: HS is used when you have a pair of horseshoe sentences, and one ends the way the other one begins. In this case, notice that the T is in common between lines 5 and 6.

First, you’ll have the givens and what you need to prove, in this case, G ⊃ E Notice that lines 1 and 2 are horseshoes, and these lines begin with a P and with a Q. That P and Q match lines 3 and 4, so you can do a simple set of Modus Ponens first. Once you do the Modus Ponens, you can definitely see the Hypothetical Syllogism HS:

Now let’s look at a sample of Disjunctive Syllogism DS

In this problem, the first line is a wedge (disjunction), and the second part of it is a complex horseshoe: p= F and q= (D ⊃ T) In order to work out way toward the T after the slash, we will need to separate out the T from line 1 by first breaking up the wedge, and then breaking up the horseshoe.

Break up the wedge first, by using a Disjunctive Syllogism (DS). This rule says that if you have a wedge sentence, and on some other line you have an added negation on the front of the wedge sentence, you are able to write the second half of the wedge on a line by itself. Here we have F v (D ⊃ T), and ~F, so we can write D ⊃ T on a line by itself.

The last step to solve the problem is to do a Modus Ponens MP, to break out the T from D ⊃ T Then simply write the result: 5. T 3,4 MP