Use rules of inference to show that the hypothesis "All lions are fierce","Some Lions do not drink coffee" imply the conclusion "Some fierce creatures do not drink coffee".
Let’s let L(x) be “x is a lion,” F(x) be “x is fierce,” and C(x) be “x drinks coffee.”
All lions are fierce. ∀x(L(x)→F(x)) Some lions do not drink coffee. ∃x(L(x)∧¬C(x)) Some fierce creatures do not drink coffee. ∃x(F(x)∧¬C(x))\begin{aligned} \text { All lions are fierce. } & \forall x(L(x) \rightarrow F(x)) \\ \text { Some lions do not drink coffee. } & \exists x(L(x) \wedge \neg C(x)) \\ \text { Some fierce creatures do not drink coffee. } & \exists x(F(x) \wedge \neg C(x)) \end{aligned} All lions are fierce. Some lions do not drink coffee. Some fierce creatures do not drink coffee. ∀x(L(x)→F(x))∃x(L(x)∧¬C(x))∃x(F(x)∧¬C(x))
Need a fast expert's response?
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS!
Comments