Show that (p → r) ∨ (q → r) and (p ∧ q) → r are logically equivalent.
The Answer to the Question
is below this banner.
Can't find a solution anywhere?
NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?
Get the Answers Now!You will get a detailed answer to your question or assignment in the shortest time possible.
Here's the Solution to this Question
\equiv (\neg p\lor r) \lor (\neg q\lor r) \ \ \ \ \ \ \ (Implication)
\equiv \neg p\lor r \lor \neg q\lor r \ \ \ \ \ \ \
\equiv (\neg p \lor \neg q)\lor r \ \ \ \ \ \ \ (Distribution)
(De Morgan's Law)
(Implication)
Hence proved ,
and are logically equivalent.