A logical binary relation □ ,is defined as follows: Let ~ be the unary…
GATE · 2006 · CS
A logical binary relation □ ,is defined as follows:
Let ~ be the unary negation (NOT) operator, with higher precedence than □.
Which one of the following is equivalent to A∧B ?
- A.
(~A □ B)
- B.
~(A □ ~B)
- C.
~(~A □ ~B)
- D.
~(~A □ B)
Attempted by 270 students.
Sign up free to check your answer
Sign up freeLoading lesson…