Boolean Algebra Calculator

Type a statement with and, or and not to simplify it.

Variables are single letters. Use and, or, not, xor, implies, iff, or the symbols ∧ ∨ ¬ ⊕ → ↔, and brackets.

Try

Result

You entered¬(A∧B)\lnot (A \land B)

¬A∨¬B\displaystyle \lnot A \lor \lnot B

Boolean algebra notation

A‾+B‾\displaystyle \overline{A} + \overline{B}

Minterms

∑m(0,1,2)\displaystyle \textstyle\sum m(0, 1, 2)
Show the work
  1. Minterms from the truth table

    List every row of the truth table (4 rows for 2 variables) where the statement is true; each row is a minterm, numbered by reading A, B as a binary number (true = 1).

    Using f=∑m(… )f = \sum m(\dots)

    f(A,B)=∑m(0,1,2)f(A, B) = \textstyle\sum m(0, 1, 2)
  2. Prime implicants (Quine–McCluskey)

    Combine minterms that differ in exactly one variable — that variable drops out — and repeat with the results until nothing more combines. What is left are the prime implicants (with the minterms each covers).

    Using XA+XA‾=XXA + X\overline{A} = X

    A‾ (0,1), B‾ (0,2)\overline{A}\ (0, 1),\ \overline{B}\ (0, 2)
  3. Essential implicants and the cover

    Every prime implicant used is essential: it alone covers some minterm.

    essential: A‾, B‾\text{essential: } \overline{A},\ \overline{B}
  4. Check

    The result agrees with the statement on all 4 rows of the truth table.

  5. Result

    The simplest sum of products.

    ¬A∨¬B(A‾+B‾)\begin{gathered} \lnot A \lor \lnot B \\ \left(\overline{A} + \overline{B}\right) \end{gathered}

Worked examples