Use universal instantiation or universal modus ponens to fill in valid conclusions for the arguments.
Universal Modus Ponens
The rule of universal instantiation can be combined with modus ponens to obtain the valid form of argument called universal modus ponens.
Universal Modus Ponens | |
Formal Version | Informal Version |
∀x, if P(x) then Q(x). | If x makes P(x) true, then x makes Q(x) true. |
P(a) for a particular a. | a makes P(x) true. |
∴ Q(a). | ∴a makes Q(x) true. |
Exercise
If an integer n equals 2 • k and k is an integer, then n is even.
0 equals 2 • 0 and 0 is an integer.
∴ _____
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.