Show that the logical equivalences in Table 6, except for the double negation law. come in pairs, where each pair contains compound propositions that are duals of each other.
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.