You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in one of the groups: Users, Administrators.


You can view and copy the source of this page.

Return to GATE2009 q24.

The binary operation □ is defined as follows

$P$ $Q$ $P□Q$
T T T
T F T
F T F
F F T

(A) $\neg Q □ ¬P$

(B) $P□\neg Q$

(C) $\neg P□Q$

(D) $\neg P□ \neg Q$

Solution by Happy Mittal[edit]

If we compare column of $P\neg 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.




blog comments powered by Disqus