3.

4 Arguments with Quantified Statements

3.4 Arguments with Quantified Statements 1/9

The rule of universal instantiation

Fact
If some property is true of everything in a set, then it is true of any
particular thing in the set.

3.4 Arguments with Quantified Statements 2/9

The rule of universal instantiation

Fact
If some property is true of everything in a set, then it is true of any
particular thing in the set.
∀x, P(x)
∴ P(a).

3.4 Arguments with Quantified Statements 2/9

The rule of universal instantiation

Fact
If some property is true of everything in a set, then it is true of any
particular thing in the set.
∀x, P(x)
∴ P(a).
Example: All students in SM242 took a quiz on Friday. I am a
student in SM242. ∴ I took a quiz on Friday.

3.4 Arguments with Quantified Statements 2/9

Universal Modus Ponens

Fact
∀x, if P(x) then Q(x).
P(a) for a particular a.
∴ Q(a).

3.4 Arguments with Quantified Statements 3/9

Universal Modus Ponens

Fact
∀x, if P(x) then Q(x).
P(a) for a particular a.
∴ Q(a).

Example
Write the conclusion that can be inferred using universal modus ponens:
If T is any right triangle with hypotenuse c and legs a and b, then
c 2 = a2 + b 2 .
S is a right triangle with both legs equal to 1 and hypotenuse c.
∴

3.4 Arguments with Quantified Statements 3/9

Universal Modus Ponens

Fact
∀x, if P(x) then Q(x).
P(a) for a particular a.
∴ Q(a).

Example
Write the conclusion that can be inferred using universal modus ponens:
If T is any right triangle with hypotenuse c and legs a and b, then
c 2 = a2 + b 2 .
S is a right triangle with both legs equal to 1 and hypotenuse c.
∴ c 2 = 12 + 12 = 2.

3.4 Arguments with Quantified Statements 3/9

Universal Modus Tollens

Fact
∀x, if P(x) then Q(x).
∼ Q(a), for a particular a.
∴

3.4 Arguments with Quantified Statements 4/9

Universal Modus Tollens

Fact
∀x, if P(x) then Q(x).
∼ Q(a), for a particular a.
∴ ∼ P(a).

Example
Rewrite the following argument using quantifiers, variables, and predicate
symbols. Write the major premise in conditional form. Is this argument
valid? Why?
All human beings are mortal.
Zeus is not mortal.
∴ Zeus is not human.

3.4 Arguments with Quantified Statements 4/9

Proving Validity of Arguments with Quantified Statements

Definition
To say that an argument form is valid means the following: No
matter what particular predicates are substituted for the predicate
symbols in its premises, if the resulting premise statements are all
true, then the conclusion is also true.
An argument is called valid if, and only if, its form is valid.

3.4 Arguments with Quantified Statements 5/9

Universal Transitivity

Fact
∀x, P(x) → Q(x)
∀x, Q(x) → R(x)
∴ ∀x, P(x) → R(x).

3.4 Arguments with Quantified Statements 6/9

Examples

Examples
For the following examples, what relevant conclusion or conclusions can be
drawn? Explain the rules of inference used to obtain each of the
conclusion from the premises.
1 “If I take the day off, it either rains or snows.” “I took Tuesday off or
I took Thursday off.” “It was sunny on Tuesday.” “It did not snow on
Thursday.”

3.4 Arguments with Quantified Statements 7/9

Examples

Examples
For the following examples, what relevant conclusion or conclusions can be
drawn? Explain the rules of inference used to obtain each of the
conclusion from the premises.
1 “If I take the day off, it either rains or snows.” “I took Tuesday off or
I took Thursday off.” “It was sunny on Tuesday.” “It did not snow on
Thursday.”
2 “If I eat spicy foods, then I have strange dreams.” “I have strange
dreams if there is thunder while I sleep.” “I did not have strange
dreams.”

3.4 Arguments with Quantified Statements 7/9

Examples

Examples
For the following examples, what relevant conclusion or conclusions can be
drawn? Explain the rules of inference used to obtain each of the
conclusion from the premises.
1 “If I take the day off, it either rains or snows.” “I took Tuesday off or
I took Thursday off.” “It was sunny on Tuesday.” “It did not snow on
Thursday.”
2 “If I eat spicy foods, then I have strange dreams.” “I have strange
dreams if there is thunder while I sleep.” “I did not have strange
dreams.”
3 “I am either clever or lucky.” “I am not lucky.” “If I am lucky, then I
will win the lottery.”

3.4 Arguments with Quantified Statements 7/9

Errors

Converse Error
∀x, if P(x) then Q(x).
Q(a) for a particular a.

3.4 Arguments with Quantified Statements 8/9

Errors

Converse Error
∀x, if P(x) then Q(x).
Q(a) for a particular a.
∴ P(a).

3.4 Arguments with Quantified Statements 8/9

Errors

Converse Error
∀x, if P(x) then Q(x).
Q(a) for a particular a.
∴ P(a).

Inverse Error
∀x, if P(x) then Q(x).
∼ P(a), for a particular a.

3.4 Arguments with Quantified Statements 8/9

Errors

Converse Error
∀x, if P(x) then Q(x).
Q(a) for a particular a.
∴ P(a).

Inverse Error
∀x, if P(x) then Q(x).
∼ P(a), for a particular a.
∴∼ Q(a).

3.4 Arguments with Quantified Statements 8/9

Examples

Are the following arguments correct?

Example
All polynomials are differentiable.
f is not a polynomial.
∴ f is not a differentiable function.

Example
All polynomials are differentiable.
f is a differentiable function.
∴ f is a polynomial.

3.4 Arguments with Quantified Statements 9/9