((A + B)·C)′ — De Morgan's laws

coreproduct of a sum, negated

Answer

A′ · B′ + C′

Why this example is worth doing

A negated product whose first factor is itself a sum, so the first application yields (A + B)′ + C̄ and the second turns the leading term into Ā·B̄. Expanding gives a two-term sum of products. The page uses this to show that De Morgan and distribution commute for the purposes of getting to a normal form — you may push all negations in first and then flatten, or flatten first — but that pushing negations in first is far less error-prone, which is why the tool's own normaliser does it in that order.

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) · C)′A′ · B′ + C′De Morgan swaps the operator as the bar passes through it.

Truth table

Truth table — columns #, A, B, C, F
#ABCF
00001
10011
20101
30110
41001
51010
61101
71110

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)