Answer to Question #291551 in Discrete Mathematics for hilly

Question #291551

Show that (p → q) ∧ (p → r) and p → (q ∧ r) are logically equivalent using

logical equivalence laws.


1
Expert's answer
2022-01-31T12:17:00-0500

From the left hand side,

(pq)(pr)(¬pq)(¬pr)(p\rightarrow q)\land(p\rightarrow r)\equiv(\neg p\lor q)\land(\neg p\lor r) (by reduction of \rightarrow )

¬p(qr)\equiv\neg p\lor(q\land r) (by idempotence of \lor )

p(qr)\equiv p\rightarrow(q\land r) (by reduction of \rightarrow )

Therefore, (pq)(pr) and p(qr)(p\rightarrow q)\land(p\rightarrow r)\space and \space p\rightarrow(q\land r) \\ are logically equivalent.


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!

Leave a comment