Use Theorem 2.1.1 to verify the logical equivalences in 50–54. Supply a reason for each step.
∼(p ∨ ∼q) ∨ (∼p ∧ ∼q) ≡ ∼p
Reference:
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.