Define a new sentential connective ▿, called nor, by the following truth table.
P | q | p▿q |
T | T | F |
F | T | F |
T | F | F |
F | F | T |
(a) Use a truth table to show that p ▿ p is logically equivalent to ~p.
(b) Complete a truth table for (p ∨ p) ▿ (q ▿ q).
(c) Which of our basic connectives (p ∧q, p∨ q, p ⇒ q, p ⇔ q) is logically equivalent to (p ▿ p) ▿ (q ∨ q)?
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.