UsefulVerse
Language · English

Free to use, no account

Boolean Algebra Calculator

Enter a logic expression to get minimized sum-of-products and product-of-sums forms. Check every truth-table row and view a Karnaugh map when the expression has two to four variables.

Use variable letters A–F, constants 0 and 1, and the symbols ! & ^ |. Parentheses group expressions.

Exact minimization for accepted expressions. At most 6 variables and 180 characters; Karnaugh maps display for 2–4 variables. Equivalent minimal forms can differ. This is not a circuit simulator or formal proof tool.

How do you simplify a Boolean expression?

Enter an expression with variables A–F and Boolean operators, then select Simplify. Compare its SOP and POS forms with the generated truth table. For two to four variables, the tool also shows a Gray-ordered Karnaugh map.

Frequently asked questions

How do you simplify a Boolean expression?

Enter an expression with variables A–F and Boolean operators, then select Simplify. Compare its SOP and POS forms with the generated truth table. For two to four variables, the tool also shows a Gray-ordered Karnaugh map.

Is my Boolean expression uploaded?

No. Parsing, minimization, truth-table generation and Karnaugh-map layout run in this browser. The expression is not uploaded or saved by this tool.

What do SOP and POS mean in Boolean algebra?

SOP combines AND terms with OR; POS combines OR clauses with AND. This tool computes both forms from the same truth table.

When is a Karnaugh map shown?

A Gray-ordered Karnaugh map is shown for expressions with two, three or four variables. The truth table and minimized forms support up to six variables.