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)∨(A∧¬B)(A \land B) \lor (A \land \lnot B)

A\displaystyle A

Boolean algebra notation

A\displaystyle A

Minterms

∑m(2,3)\displaystyle \textstyle\sum m(2, 3)
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(2,3)f(A, B) = \textstyle\sum m(2, 3)
  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 (2,3)A\ (2, 3)
  3. Essential implicants and the cover

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

    essential: A\text{essential: } A
  4. Check

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

  5. Result

    The simplest sum of products.

    A(A)\begin{gathered} A \\ \left(A\right) \end{gathered}

Worked examples