Professional Documents
Culture Documents
Section 1.6
RIZOAN TOUFIQ
ASSISTANT PROFESSOR
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
RAJSHAHI UNIVERSITY OF ENGINEERING & TECHNOLOGY
Section Summary
⬥ Valid Arguments
⬥ Inference Rules for Propositional Logic
⬥ Using Rules of Inference to Build Arguments
– Resolution
– Fallacies
⬥ Rules of Inference for Quantified Statements
⬥ Combining Rules of Inference for Propositions and Quantified
Statements
Valid Arguments in Propositional Logic
TRUE
Q: The statement
((p → q) ∧ p) → q
is a tautology?
Valid Arguments in Propositional Logic
p q p→q (p → q) ∧ ((p → q) ∧ p) →
p q
Ta
0 0 1 0 1
ut
ol
0 1 1 0 1
og
y
1 0 0 0 1
1 1 1 1 1
PROVED
Modus Ponens
Corresponding Tautology:
(p ∧ (p →q)) → q
Example:
Let p be “It is snowing.”
Let q be “I will study discrete math.”
“It is snowing.”
“If it is snowing, then I will study discrete math.”
Modus Tollens
Corresponding Tautology:
(¬q∧(p →q))→¬p
Example:
Let p be “it is snowing.”
Let q be “I will study discrete math.”
Hypothetical Syllogism
Corresponding Tautology:
((p →q) ∧ (q→r))→(p→ r)
Example:
Let p be “it snows.”
Let q be “I will study discrete math.”
Let r be “I will get an A.”
Disjunctive Syllogism
Corresponding Tautology:
(¬p∧(p ∨q))→q
Example:
Let p be “I will study discrete math.”
Let q be “I will study English literature.”
Addition
Corresponding Tautology:
p →(p ∨q)
Example:
Let p be “I will study discrete math.”
Let q be “I will visit Las Vegas.”
Simplification
Corresponding Tautology:
(p∧q) →p
Example:
Let p be “I will study discrete math.”
Let q be “I will study English literature.”
Conjunction
Corresponding Tautology:
((p) ∧ (q)) →(p ∧ q)
Example:
Let p be “I will study discrete math.”
Let q be “I will study English literature.”
C
Using the Rules of Inference to Build Valid
Arguments
Solution:
Using the Rules of Inference to Build Valid
Arguments
Example 2:
⬥ With these hypotheses/premises:
“It is not sunny this afternoon and it is colder than yesterday.”
“We will go swimming only if it is sunny.”
“If we do not go swimming, then we will take a canoe trip.”
“If we take a canoe trip, then we will be home by sunset.”
⬥ Using the inference rules, construct a valid argument for the conclusion:
“We will be home by sunset.”
Solution:
1. Choose propositional variables:
p : “It is sunny this afternoon.”
q : “It is colder than yesterday.”
r : “We will go swimming.”
s : “We will take a canoe trip.”
t : “We will be home by sunset.”
Using the Rules of Inference to Build Valid
Arguments
Example 2:
⬥ With these hypotheses/premises:
“It is not sunny this afternoon and it is colder than yesterday.”
“We will go swimming only if it is sunny.”
“If we do not go swimming, then we will take a canoe trip.”
“If we take a canoe trip, then we will be home by sunset.”
⬥ Using the inference rules, construct a valid argument for the conclusion:
“We will be home by sunset.”
Resolution
Corresponding Tautology:
((¬p ∨ r ) ∧ (p ∨ q)) →(q ∨ r)
*Resolution plays an important role in
AI and is used in Prolog.
Example:
Let p be “I will study discrete math.”
Let r be “I will study English literature.”
Let q be “I will study databases.”
⬥ This type of incorrect reasoning is called the fallacy of affirming the conclusion.
Fallacies
⬥ The proposition ((p → q) ∧¬p) →¬q is not a tautology, because it is false when p
is false and q is true.
⬥ Example: Is the following argument valid?
• If you do every problem in this book, then you will learn discrete
mathematics.
• you did not do every problem in this book.
• Therefore, You did not learned discrete mathematics.
⬥ This type of incorrect reasoning is called the fallacy of denying the hypothesis.
Rules of Inference for Quantified Statements
Universal Instantiation (UI)
Example:
Example:
Example:
Home Task
Universal Modus Ponens