Question: Prove that {XOR, AND, TRUE} is functionally complete, i.e.,any propositional formula is equivalent to one whose only connectives are XOR and AND, along with the
Prove that {XOR, AND, TRUE} is functionally complete, i.e.,any propositional formula is equivalent to one whose only connectives are XOR and AND, along with the constant TRUE. You may assume that {XOR}is logically equivalent to (p q) (q p). You may also assume that {, , } is functionally complete. Prove using a series of logical equivalences.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
