Solution to Use a truth table to verify this De Morgan’s law: ¬(p ∧ q) ≡ ¬p … - Sikademy
Author Image

Archangel Macsika

Use a truth table to verify this De Morgan’s law: ¬(p ∧ q) ≡ ¬p ∨ ¬q

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

Let us use a truth table to verify this De Morgan’s law:

¬(p ∧ q) ≡ ¬p ∨ ¬q.


We have the following trush table:


\begin{array}{||c|c||c|c|c|c|c||} \hline\hline p & q & p\land q & \neg p & \neg q & \neg(p\land q) & \neg p\lor\neg q\\ \hline\hline F & F & F & T & T & T & T \\ \hline F & T & F & T & F & T & T \\ \hline T & F & F & F & T & T & T\\ \hline T & T & T & F & F & F & F \\ \hline\hline \end{array}


Since the last two columns are coinside, we conclude that the De Morgan’s law is indeed true.


Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-1270-qpid-1008