Answer:
a) [tex]\forall x,P(x) \to Q(x)[/tex]
b) [tex]\exists x:R(x) \land(\sim Q(x))[/tex]
c)[tex]\exists x:R(x) \land(\sim P(x))[/tex]
d) Yes, it does.
Step-by-step explanation:
P(x) = “x is a clear explanation”
Q(x) = “x is satisfactory”
R(x) = “ x is a excuse”
We will be denoting “such that” as “:” and “not” as “~”
a) All clear explanations are satisfactory.
[tex]\forall x,P(x) \to Q(x)[/tex]
b) Some excuses are unsatisfactory.
[tex]\exists x:R(x) \land(\sim Q(x))[/tex]
c) Some excuses are not clear explanations.
[tex]\exists x:R(x) \land(\sim P(x))[/tex]
d) Does (c) follow from (a) and (b)?
Yes, it does.
(a) can be expressed as “If x is a clear explanation then x is satisfactory”
Recall that
[tex]P\rightarrow Q[/tex] is equivalent to [tex]\sim Q \rightarrow \sim P[/tex]
So (a) can be paraphrased as
“If x is not satisfactory then x is not a clear explanation”
Joining b) and a) we get
“Some excuses are not satisfactory and if a excuse is not satisfactory then the excuse is not a clear explanation”
From here we deduce that,
“Some excuses are not clear explanations”