I need to figure out how to express the NOT operator in terms of the operators AND, XOR, XNOR.
I need to show that this set is functionally complete, which I'm trying to do by showing that I can represent NOT and OR, a known complete set. But I have no idea where to begin when it comes to representing a unary operator (NOT) using binary operators.
EDIT: I figured it out. NOT A=(A XNOR A) XOR A