Show that ¬ and ∨ form a functionally complete collection of logical operators. The following exercises involve the logical operators NAND and NOR. The proposition p NAND q is true when either p or q, or both, are false; and it is false when both p and q are true. The proposition p NOR q is true when both p and q are false, and it is false otherwise. The propositions p NAND q and p NOR q are denoted by p |q and p ↓ q, respectively. (The operators | and ↓, are called the Sheffer stroke and the Peircc arrow after H. M. Sheftier and C. S. Peirce. respectively.)
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.