(A ⊕ B)′ — De Morgan's laws

exam standardXOR complement is XNOR

Answer

A′ ⊕ B

Why this example is worth doing

De Morgan does not apply directly to XOR, and that is the point of including it. You must first expand A ⊕ B to A·B̄ + Ā·B, then negate, then push the negations in, arriving at A·B + Ā·B̄ — which is XNOR. The page flags the shortcut students try instead, complementing either operand: Ā ⊕ B also equals XNOR, which is true and often useful, but complementing both operands leaves XOR unchanged. Those two facts together are worth more than the derivation.

Try your own input in the De Morgan’s laws. Push a negation through any expression and see both forms side by side.

How the answer is reached

Negation pushed inwards

(A ⊕ B)′A′ ⊕ BDe Morgan swaps the operator as the bar passes through it.

Truth table

Truth table — columns #, A, B, F
#ABF
0001
1010
2100
3111

Compare with

Open this example in the De Morgan’s laws

The field arrives filled in with this example’s input.

Note:

Notation this page assumes

  • Symbols: · is AND, + is OR, ⊕ is XOR, a prime or an overline is NOT. The field also takes ∧ ∨ ¬ ~ ! & | and the words.
  • Operator precedence, tightest first: NOT, then AND (including juxtaposition), then XOR/XNOR, then NAND/NOR, then OR, then IMPLIES, then IFF.
  • In a minterm index the first variable is the most significant bit, so over [A, B, C] minterm 5 is A·B̄·C.

Sources

  • De Morgan, Formal Logic (1847)
  • Boole, An Investigation of the Laws of Thought (1854)