Discrete
Discrete
Class= BS-SE-II
Rules of Inference
The rules of inference also known as inference rules are a logical form or guide consisting of premises (or hypotheses)
and draw a conclusion. A valid argument is when the conclusion is true whenever all the beliefs are true, and an invalid
argument is called a fallacy.
1.Addition
The Addition rule is one the common inference rule, and it states that If P is true, then P∨Q will be true. Its notation is
__P__
∴PVQ
Example 1
Let P be the proposition, “He studies very hard.”
If P is true
Example 2
Let P be “I will study discrete math.”
Therefore, I will study discrete math or I will visit Las Vegas. , PvQ
Here Let Q is “I will visit Las Vegas.”
Example 3
Let P be “I have a vanilla ice-cream.”
Example 4
Let Q is “I will make tea.”
Therefore I will make tea, or I will read a book. , PvQ
Example 5
Let P is “I am sick.”
2.Conjunction
If P and Q are two premises, we can use Conjunction rule to derive P∧Q. Its notation is
P
___Q
∴P∧Q
Example 1
Let P be “He studies very hard”
Therefore he studies very hard and he is the best boy in the class. , P∧Q
Example 2
Let p be “I will study discrete math.”
Therefore I will study discrete math and I will study English literature. , P∧Q
Example 3
Let P be “He studies hard.”
Example 4
Let P be “Michael like skiing.”
Example 5
Let P be “Ice is sticky to walk on.”
Therefore ice is sticky to walk on and mud sticks to your shoes. , P∧Q
3.Simplification
The simplification rule state that if P∧ Q is true, then Q or P will also be true. It can be represented as:
_P∧Q
∴P
Example 1
He studies very hard and he is the best boy in the class. , P∧Q
Example 2
I will study discrete math and English literature. , P∧Q
Example 3
Sidra likes both skiing and jazz dancing. , P∧Q
Example 4
I will make tea and I will read a book. , P∧Q
Example 5
I will study discrete mathematics and physics. , P∧Q
4.Modus Ponens
The Modus Ponens rule is one of the most important rules of inference, and it states that if P and P → Q is true, then we
can infer that Q will be true. It is represented as
P→Q
_P__
∴Q
Example 1
If you have a password, then you can log on to facebook. , P→Q
You have a password. , P
Example 2
If I am sleepy then I go to bed. , P→ Q
I am sleepy. , P
Therefore I go to bed.
Example 3
If I will study protein structures, then I will study biochemistry. ,P→Q
Example 4
If it is raining then I will make tea. ,P→Q
It is raining. ,P
Example 5
If tweety is a bird then tweety flies. ,P→Q
Tweety is a bird. ,P
5.Modus Tollens
The Modus Tollens rule state that if P→ Q is true and ¬ Q is true, then ¬ P will also true. It can be represented as:
P→Q
_¬Q_
∴¬P
Example 1
Example 2
If you have a password, then you can log on to facebook. , P→Q
Example 3
If I am sleepy then I go to bed. , P→ Q
Example 4
If it is raining then I will make tea. , P→ Q
Example 5
If you get chocolates then you won’t need popcorn. , P→ Q
6.Disjunctive Syllogism
The Disjunctive syllogism rule state that if P∨Q is true, and ¬P is true, then Q will be true. It can be represented as:
P∨Q
_¬P_
∴Q
Example 1
The ice cream is not vanilla flavored. , ¬P
Example 2
Today is Sunday or Monday. , P∨Q
Example 3
I will study discrete math or I will study English literature. , P∨Q
Example 4
I will make tea or I will read a book. , P∨Q
Example 5
The ice-cream is either vanilla flavored or chocolate flavored. ,P∨Q
7.Hypothetical Syllogism
The Hypothetical Syllogism rule state that if P→R is true whenever P→Q is true, and Q→R is true. It can be represented
as the following notation:
P→Q
Q→R_
∴P→R
Example 1
If it rains, I shall not go to school. , P→Q
Example 2
If you have my home key then you can unlock my home. ,P→Q
If you can unlock my home then you can take my money. ,Q→R
Therefore, if you have my home key then you can take my money. ,P→R
Example 3
If it snows, then I will study discrete math. ,P→Q
Example 5
If I do not pay taxes, I will be committing a crime. ,P→Q
8.Constructive Dilemma
If (P→Q)∧(R→S) and P∨R are two premises, we can use constructive dilemma to derive Q∨S. It is represented as:
(P→Q)∧(R→S)
____P∨R_____
∴Q∨S
Example 1
If it rains, I will take a leave. , (P→Q)
Example 2
If I will study discrete math, then I will study computer science. , (P→Q)
Example 3
If I am running then I am happy. , (P→Q)
Example 4
If I will eat the popcorn then I will feel guilty. , (P→Q)
Example 5
If I win a million dollars then I will donate it to Al-Hama foundation. , (P→Q)
If my friend wins a million dollars then he will donate it to wildlife funds. , (R→S)
Therefore, I will donate it to Al-Hama foundation or he will donate it to wildlife funds. , Q∨S
9.Destructive Dilemma
If (P→Q)∧(R→S) and ¬Q∨¬S are two premises, we can use destructive dilemma to derive ¬P∨¬R. It is represented as:
(P→Q)∧(R→S)
___¬Q∨¬S____
∴¬P∨¬R
Example 1
If it rains, I will take a leave. , (P→Q)
Either I will not take a leave or I will not go for a shower. , ¬Q∨¬S
Example 2
If I will study discrete math, then I will study computer science. , (P→Q)
I will not study computer science or I will not study biochemistry. , ¬Q∨¬S
Therefore, I will not study discrete math or I will not study protein structures. ,¬P∨¬R
Example 3
If it rains then we will stay inside. , (P→Q)
Either we will not stay inside or we will not go for a walk. , ¬Q∨¬S
Therefore, either it will not rain, or it will not be sunny, or both. ,¬P∨¬R
Example 4
If I eat the pretzel then I will need a drink. , (P→Q)
Either I will not need a drink or I will not want chocolate. , ¬Q∨¬S
Therefore, either I did not eat the pretzel or I did not eat ice-cream. ,¬P∨¬R
Example 5
If a chief justice will not be appointed then there will be a vacuum of leadership in the judiciary. , (P→Q)
If a new president will not be elected then there will be vacuum of leadership in senate. , (R→S)
Therefore, either a chief justice will be appointed or a new president will be elected. ,¬P∨¬R