Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) |
||
| Line 22: | Line 22: | ||
|} | |} | ||
Which one of the following is equivalent to $P ∨ Q$? | Which one of the following is equivalent to $P ∨ Q$? | ||
| + | |||
(A) $\neg Q □ ¬P$ | (A) $\neg Q □ ¬P$ | ||
| Line 32: | Line 33: | ||
If we compare column of $P□ Q$ in table with $P ∨ Q$, we need both F in $3^{rd}$ row of table, and for that we need | If we compare column of $P□ Q$ in table with $P ∨ Q$, we need both F in $3^{rd}$ row of table, and for that we need | ||
| − | $\ | + | $\neg Q$ instead of $Q$. So $P ∨ Q$ is equivalent to $P□\neg Q$, and therefore, option <b>(B)</b> is correct. |
{{Template:FBD}} | {{Template:FBD}} | ||
The binary operation □ is defined as follows
| $P$ | $Q$ | $P□Q$ |
|---|---|---|
| T | T | T |
| T | F | T |
| F | T | F |
| F | F | T |
Which one of the following is equivalent to $P ∨ Q$?
(A) $\neg Q □ ¬P$
(B) $P□\neg Q$
(C) $\neg P□Q$
(D) $\neg P□ \neg Q$
If we compare column of $P□ Q$ in table with $P ∨ Q$, we need both F in $3^{rd}$ row of table, and for that we need $\neg Q$ instead of $Q$. So $P ∨ Q$ is equivalent to $P□\neg Q$, and therefore, option (B) is correct.
The binary operation □ is defined as follows
| $P$ | $Q$ | $P□Q$ |
|---|---|---|
| T | T | T |
| T | F | T |
| F | T | F |
| F | F | T |
Which one of the following is equivalent to $P ∨ Q$? (A) $\neg Q □ ¬P$
(B) $P□\neg Q$
(C) $\neg P□Q$
(D) $\neg P□ \neg Q$
If we compare column of $P□ Q$ in table with $P ∨ Q$, we need both F in $3^{rd}$ row of table, and for that we need $\negQ$ instead of $Q$. So $P ∨ Q$ is equivalent to $P□\negQ$, and therefore, option (B) is correct.
GATECSE