Suppose that p and q are any statements. By constructing the truth tables, show that the statement ¬ (p V q) & (¬ p) ∧ (¬ q) 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?

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 construct the trush table for the formulas $¬ (p \lor q)$ and $(¬ p) \land (¬ q) :$

$\begin{array}{||c|c||c|c|c|c|c||} \hline\hline p & q & p \lor q & ¬ p & ¬ q & ¬ (p \lor q) & (¬ p) \land (¬ q) \\ \hline\hline 0 & 0 & 0 & 1 & 1 & 1 & 1\\ \hline 0 & 1 & 1 & 1 & 0 & 0 & 0\\ \hline 1 & 0 & 1 & 0 & 1 & 0 & 0\\ \hline 1 & 1 & 1 & 0 & 0 & 0 & 0\\ \hline\hline \end{array}$

Since the last two columns are coinside, the formulas $¬ (p \lor q)$ and $(¬ p) \land (¬ q)$ are logically equivalent.

Suppose that p and q are any statements. By constructing the truth tables, show that the statement ¬ (p V q) & (¬ p) ∧ (¬ q) are logically equivalent.

Here's the Solution to this Question

Related Answers

Was this answer helpful?

Join our Community to stay in the know

Question ID: mtid-5-stid-8-sqid-916-qpid-771