‹ Back to the paper
Question 1(a)
1 mark
Computer ScienceISC 2017 Computer Science Paper 1Truth tableBoolean Algebra
Answer the following using a truth table.
State the law represented by the following proposition and prove it with the help of a truth table:
Answer
Answer
| P | P ∨ P | P ∨ P <=> P |
| 0 | 0 | 1 |
| 1 | 1 | 1 |
It is the Idempotent law (for OR): $P + P = P$.
The columns for $P \lor P$ and $P$ are the same in both rows, so $P \lor P = P$ is proved.