1
$\begingroup$

Show that $(p \rightarrow q) \wedge (p \rightarrow r)$ and $p \rightarrow (q \wedge r)$ are logically equivalent.

I tried to do this making a truth table but I think my teacher wants me to solve it using the different laws of Logical Equivalences.

Can anyone help me?

$\endgroup$
4
  • 4
    $\begingroup$ Which equivalences do you have available? Particularly involving $\to$. $\endgroup$ Commented Mar 15, 2015 at 16:44
  • $\begingroup$ I have that $p \rightarrow q \equiv \neg p \vee q$ $\endgroup$ Commented Mar 15, 2015 at 16:47
  • 3
    $\begingroup$ x @Aziz: Use that on both sides, then the distributive law. $\endgroup$ Commented Mar 15, 2015 at 16:51
  • $\begingroup$ If I do it I'll get $\neg p \vee q \wedge \neg p \vee r$ then $\neg p \vee (q \wedge r)$ and $p \rightarrow (q \wedge r)$ and it is correct. Thank you @ henning Makholm $\endgroup$ Commented Mar 15, 2015 at 16:58

1 Answer 1

3
$\begingroup$

Here is an approach

$$(p \to q) \wedge (p \to r) \equiv (\neg p \vee q) \wedge (\neg p \vee r) \equiv \neg p \vee (q \wedge r) \equiv p \to (q \wedge r)$$

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .