Show that the or connective is unnecessary in the sense that any statement of the fonn (p ∨ q) can be written in an equivalent form that does not use ∨.
The stroke connective has the following truth table
p | Q | P|q |
T | T | F |
T | F | T |
F | T | T |
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.