Discrete Math Rules of Inference
Discrete Math Rules of Inference
C. If it is rainy, then the pool will be closed. It is rainy. Therefore, the pool is closed.
argument:
This is a clear example of modus ponens, where you affirm the consequent (Q) because you've already
affirmed the antecedent (P) and the conditional statement (P → Q) is assumed to be true.
For each of these collections of premises, what relevant conclusion or conclusions can be drawn?
Explain the rules of inference used to obtain each conclusion from the premises. "I am either clever or
lucky." "I am not lucky." "If I am lucky, then I will win the lottery."
Let's analyze the given premises and draw relevant conclusions using rules of inference:
This is a logical disjunction (OR) statement. In symbolic logic, it can be represented as: P ∨ Q Where P
represents "I am clever," and Q represents "I am lucky."
This statement negates the possibility of being lucky: ¬Q Where ¬ represents "not."
This is a conditional statement (implication) that connects being lucky to winning the lottery: Q → R
Where Q represents "I am lucky," and R represents "I will win the lottery."
have a disjunction (P ∨ Q) and the negation of one of the options (¬Q), you can conclude the other
Now, let's use a rule of inference called Disjunctive Syllogism. Disjunctive Syllogism states that if you
option (P).
Using Disjunctive Syllogism, we can conclude P (I am clever): P ∨ Q (from premise 1) ¬Q (from premise
2) Therefore, P (I am clever)
To summarize, using the rules of inference (Disjunctive Syllogism), the relevant conclusion is that you
are clever.
Let p=”I am clever”, q=”I am lucky”, r=”I will win the lottery”
(1) p ∨ q Premise
(2) ¬q Premise
Answer: I am clever
"I am either clever or lucky."
This is a logical disjunction (OR) statement. In symbolic logic, it can be represented as: P ∨ Q Where P
represents "I am clever," and Q represents "I am lucky."
This statement negates the possibility of being lucky: ¬Q Where ¬ represents "not."
This is a conditional statement (implication) that connects being lucky to winning the lottery: Q → R
Where Q represents "I am lucky," and R represents "I will win the lottery."
have a disjunction (P ∨ Q) and the negation of one of the options (¬Q), you can conclude the other
Now, let's use a rule of inference called Disjunctive Syllogism. Disjunctive Syllogism states that if you
option (P).
Using Disjunctive Syllogism, we can conclude P (I am clever): P ∨ Q (from premise 1) ¬Q (from premise
2) Therefore, P (I am clever)
To summarize, using the rules of inference (Disjunctive Syllogism), the relevant conclusion is that you
are clever.
Answer: I am clever
For each of these arguments, explain which rules of inference are used for each step.
- "Each of the 93 students in this class owns a personal computer. Everyone who owns a personal
computer can use a word processing program. Therefore, Zeke, a student in this class, can use a word
processing pro- gram."
The argument you provided can be analyzed as follows, with an explanation of the rules of inference
used for each step:
1."Each of the 93 students in this class owns a personal computer." Rule of Inference: Universal
Instantiation
Explanation: This step generalizes from a specific statement about each student in the class owning a
personal computer to a universal statement that all 93 students own personal computers.
2."Everyone who owns a personal computer can use a word processing program." Rule of Inference:
Instantiation
Explanation: This step generalizes from a specific statement that everyone who owns a personal
computer can use a word processing program to a universal statement that all people who own
personal computers can use word processing programs.
3."Therefore, Zeke, a student in this class, can use a word processing program." Rule of Inference:
Modus Ponens
Explanation: This step applies the Modus Ponens rule, which allows us to conclude that Zeke, a specific
student in the class (previously established as owning a personal computer), can use a word processing
program based on the premises established in steps 1 and 2.
So, the rules of inference used in this argument are Universal Generalization for the first two steps and
Modus Ponens for the final step.
C(x) = “x is in this class”
Premise 3 C(Zeke)
Conclude W(Zeke)
Step Reason
3 C(Zeke) Premise 3
“Each of the 93 students in this class owns a personal computer. Everyone who owns a personal
computer can use a word processing program. Therefore, Zeke, a student in this class, can use a word
processing program.”
Let:
P(Zeke) premise