a) Given a truth table, explain how to use disjunctive normal form to construct a compound proposition with this truth table.
b) Explain why part (a) shows that the operators ∧, ∨, and ¬ are functionally complete.
c) Is there an operator such that the set containing just this operator is functionally complete?
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.