Prove Theorem part 11.
Theorem
Example 6
The binary operation ∨ has the commutative property; that is, p ∨ q ≡ q ∨ p. The truth table for (p ∨ q) ⇔ (q ∨ p) shows the statement is a tautology.
p | q | p ∨ q | q ∨ p | (p ∨ q) ⇔ (q ∨ p) |
T | T | T | T | T |
T | F | T | T | T |
F | T | T | T | T |
F | F | F | F | T |
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.