p ↔ ¬ (r˅q)
Let us construct the trush table for the formula p↔¬(r˅q):p ↔ ¬ (r˅q):p↔¬(r˅q):
pqrr∨q¬(r∨q)p↔¬(r∨q)000010001101010101011101100011101100110100111100\begin{array}{||c|c|c||c|c|c||} \hline\hline p & q & r & r\lor q & \neg(r\lor q) &p ↔ ¬ (r\lor q)\\ \hline\hline 0 & 0 & 0 & 0 & 1 & 0\\ \hline 0 & 0 & 1 & 1 & 0 & 1\\ \hline 0 & 1 & 0 & 1 & 0 & 1\\ \hline 0 & 1 & 1 & 1 & 0 & 1\\ \hline 1 & 0 & 0 & 0 & 1 & 1\\ \hline 1 & 0 & 1 & 1 & 0 & 0\\ \hline 1 & 1 & 0 & 1 & 0 & 0\\ \hline 1 & 1 & 1 & 1 & 0 &0\\ \hline\hline \end{array}p00001111q00110011r01010101r∨q01110111¬(r∨q)10001000p↔¬(r∨q)01111000
We conclude that this formula is neither tautology, nor contradiction.
Need a fast expert's response?
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS!
Comments