Solution Found!
Some of the arguments are valid by universal
Chapter 3, Problem 13E(choose chapter or problem)
Problem 13E
Some of the arguments are valid by universal modus ponens or universal modus tollens; others are invalid and exhibit the converse or the inverse error. State which are valid and which are invalid. Justify your answers.
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. |
Universal ModusTollens
Another crucially important rule of inference is universal modus tollens.Its validity results from combining universal instantiation with modus tollens. Universal modus tollens is the heart of proof of contradiction, which is one of the most important methods of mathematical argument.
Universal Modus Tollens | |
Formal Version |
Informal Version |
∀x, if P(x) then Q(x). |
If xmakes P(x) true, then xmakes Q(x) true. |
~Q(a), for a particular a |
a does not make Q(x) true. |
∴ ~P(a). |
∴ a does not make P(x) true. |
Exercise
For all students x, if x studies discrete mathematics, then x is good at logic.
Tarik studies discrete mathematics.
∴ Tarik is good at logic.
Questions & Answers
QUESTION:
Problem 13E
Some of the arguments are valid by universal modus ponens or universal modus tollens; others are invalid and exhibit the converse or the inverse error. State which are valid and which are invalid. Justify your answers.
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. |
Universal ModusTollens
Another crucially important rule of inference is universal modus tollens.Its validity results from combining universal instantiation with modus tollens. Universal modus tollens is the heart of proof of contradiction, which is one of the most important methods of mathematical argument.
Universal Modus Tollens | |
Formal Version |
Informal Version |
∀x, if P(x) then Q(x). |
If xmakes P(x) true, then xmakes Q(x) true. |
~Q(a), for a particular a |
a does not make Q(x) true. |
∴ ~P(a). |
∴ a does not make P(x) true. |
Exercise
For all students x, if x studies discrete mathematics, then x is good at logic.
Tarik studies discrete mathematics.
∴ Tarik is good at logic.
ANSWER:
Solution
In this question we have to determine whether the argument is valid or invalid
Given argument:
For all students if studies discrete mathematics, thenis good at logic
Tarik studies discrete mathematic