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 \vee Q$?
Reveal answer
Fill a bubble to check yourself
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 \vee Q$?