0

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

zulfe
  • 47
  • 6

2 Answers2

3

Hint: $x\ \textrm{OR}\ x = x$.

Hint 2: $x\ \textrm{NOR}\ y = \textrm{NOT}\left(x\ \textrm{OR}\ y\right)$.

fgp
  • 21,438
  • Sorry I actually made a mistake typing out the question. I meant to say XOR instead of NOR. I have edited the question to reflect this – zulfe Feb 07 '16 at 19:54
  • 1
    @zulfe Well, then the Hint is that $x\ \textrm{XNOR}\ x = 1$ and that $x\ \textrm{XOR}\ 1 = \textrm{NOT}\ x$. – fgp Feb 07 '16 at 20:33
1

Since you have figured out the $\sf NOT$: to emulate $\sf OR$, what about $$ \textsf{XOR}(\textsf{XOR}(x,y),\textsf{AND}(x,y)) $$ ?

Clement C.
  • 68,437
  • This works great, thank you. I was trying to figure it out using my NOT construction but this is definitely more clear. – zulfe Feb 07 '16 at 20:36