Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

According to wikipedia, the set {^, ¬} is functionally complete. But is there any 2-set functionally complete set with XOR (e.g. (¬A) ⊕ A is always true).

I'm looking for a 2-set functionally complete with xor e.g. is {&,⊕} or {¬.⊕} functionally complete?

share|cite|improve this question
See wikipedia: "Emil Post proved that a set of logical connectives is functionally complete if and only if it is not a subset of any of the following sets of connectives ... " – Myself Mar 17 '13 at 19:28
up vote 6 down vote accepted

$\{{\neg},{\oplus}\}$ is not complete; see this question.

$\{{\land},{\oplus}\}$ is not complete either, because if all the inputs are false, then the output is always false too.

However $\{{\to}, {\oplus}\}$ is complete, because $\{{\neg},{\to}\}$ is known to be, and $(A\to A)\oplus A$ is equivalent to $\neg A$.

share|cite|improve this answer
Perfect. I'm glad you understood. – Programmer 400 Mar 17 '13 at 19:36

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.