Skip to content
Calcipedia
Boolean Algebra Calculator instructional illustration

Boolean Algebra Calculator

Simplify Boolean expressions, generate truth tables, compare equivalent forms, and read minterms, maxterms, SOP, POS.

Last updated

Boolean simplifier

Simplify a Boolean expression, inspect the truth table, and check equivalence

Enter classroom or digital-logic notation, then compare the simplified SOP, POS, minterms, maxterms, and truth table. The optional equivalence check tests whether your manual answer matches the original expression on every input row.

Built for study checks and logic-gate work Use up to four variables with common notation such as A', ¬A, A + B, A * B, XOR, NAND, and .

Quick examples

Start with a tautology, absorption-law simplification, XOR expansion, or three-variable factor.

Variables are sorted as a, b, c, d, p, q, r. Keep expressions to four distinct variables so the truth table remains readable.

Supported operators

AND: & && ∧ * OR: | || ∨ + NOT: ! ~ ¬ XOR: ^ ⊕ XNOR: XNOR NAND: NAND NOR: NOR IMPLIES: -> →

Constants: 0, 1, true, and false. Postfix complement notation such as A' is accepted.

Result

a

Minimal SOP form. Contingency: 2 true rows and 2 false rows.

The expression is true for some combinations and false for others.

Variables
a, b
Rows
4
Minterms
2, 3
Maxterms
0, 1
Normalized form
a ∧ b ∨ a ∧ ¬b
Minimal POS form
(a)

Equivalence check

Equivalent on every checked row

Compared a ∧ b ∨ a ∧ ¬b with a across a, b.

Canonical sum of minterms

a ∧ ¬b ∨ a ∧ b

Canonical product of maxterms

(a ∨ b) ∧ (a ∨ ¬b)

Truth values use 1 for true and 0 for false.

abResult
000
010
101
111
← All Functions calculators

Math & Logic

Boolean algebra calculator: simplify logic expressions and truth tables

A Boolean algebra calculator helps you simplify logic expressions, build the corresponding truth table, and see which rows create the output. It is useful when you want to check a study answer, compare equivalent forms, or reduce a gate-level expression into a cleaner version. This page also works as a Boolean expression simplifier for common classroom notation such as A', A + B, A * B, XOR, NAND, NOR, and implication.

What the calculator does

This page accepts a Boolean expression with up to four variables, then evaluates every possible input combination to produce a truth table. From that table it can identify whether the expression is a tautology, contradiction, or contingency and then show simplified sum-of-products and product-of-sums forms that match the same output.

The calculator is built for the common search intent behind Boolean algebra tools: simplify a logic expression, verify an answer, and read the output in a way that matches algebra class or digital-logic notes. It now includes an equivalence checker so you can compare your proposed simplification against the original expression row by row instead of trusting a visual match.

How the simplification works

Boolean algebra follows a small set of laws that let equivalent expressions collapse into a shorter form. The most familiar ones are identity, complement, idempotent, absorption, and De Morgan's laws. For example, p OR NOT p simplifies to 1, while p AND NOT p simplifies to 0.

The calculator checks the full truth table first and then searches for a compact sum-of-products form that still matches every true row without matching any false row. That keeps the answer tied to the actual output instead of relying on a guessed rewrite.

A ∨ ¬A = 1

Complement law: a value OR its negation is always true.

A ∧ ¬A = 0

Complement law: a value AND its negation is always false.

¬(A ∧ B) = ¬A ∨ ¬B

De Morgan's law for a negated AND. This is the specific relationship the calculator applies when building the result.

¬(A ∨ B) = ¬A ∧ ¬B

De Morgan's law for a negated OR. This is the specific relationship the calculator applies when building the result.

Minterms, maxterms, and canonical forms

A minterm is a row that makes the expression true. A maxterm is a row that makes it false. The calculator shows both lists so you can see exactly which combinations drive the output and how the expression can be written in canonical sum-of-minterms or product-of-maxterms form.

That distinction matters because the same expression can be written in more than one equivalent way. Canonical forms are useful for study and proof work, while the simplified form is the cleaner version you would usually carry forward into circuit design or homework checks.

F = Σm(…)

Canonical sum-of-minterms form: list every row where the function is true.

F = ΠM(…)

Canonical product-of-maxterms form: list every row where the function is false.

SOP, POS, and equivalence checks

Many Boolean algebra simplifier searches are really asking for one of two forms: a sum of products, often abbreviated SOP, or a product of sums, often abbreviated POS. SOP groups the rows where the function is 1. POS groups the rows where the function is 0. Seeing both versions helps when a course, Karnaugh map exercise, or digital-logic design note expects a particular form.

The optional comparison input is useful when you have a hand-derived answer and want to know if it is logically equivalent to the original expression. If the expressions differ, the calculator lists the input rows that disagree, which is usually more actionable than simply saying the answer is wrong.

F(A, B) = A B + A B' = A

A common absorption-style simplification: the output depends on A and not on B.

F = (A + B)(A + B') = A

A matching product-of-sums view of the same kind of row-based simplification.

Accepted Boolean notation

Different calculators and textbooks use different symbols for the same operators. This page accepts word operators such as AND, OR, NOT, XOR, XNOR, NAND, NOR, and IMPLIES, plus common symbols such as &, |, +, *, !, ~, ¬, ∧, ∨, ⊕, ->, and →. It also accepts postfix complement notation, so A' is treated as NOT A.

The variable set is intentionally capped at four distinct variables. That keeps the truth table, minterm list, maxterm list, and mismatch rows readable on mobile. For larger symbolic problems, a computer algebra system or a dedicated Karnaugh-map package is a better fit.

Worked example

Try the expression (A AND B) OR (A AND NOT B). The two terms share the same A literal, so the truth table shows that the expression is true exactly when A is true, no matter what B does. The simplified form is A.

That is the kind of rewrite Boolean algebra is built for: the calculator still shows the full table, but it also reveals the smaller expression hiding inside the original one. For a study problem, that gives you a check on both the output and the algebraic reasoning.

When this calculator is most useful

Use it when you want to confirm a homework simplification, inspect a logic gate expression, or compare two equivalent forms side by side. It is also helpful when you are checking whether an expression is a tautology or contradiction before you move on to a larger proof.

The current page is intentionally focused on up to four variables. That keeps the truth table readable and lets the calculator return a compact answer quickly, but it also means it is not a full substitute for a larger symbolic-logic package when you need bigger expressions, don't-care conditions, multi-output circuits, or deeper algebraic transformations.

Frequently asked questions

What is Boolean algebra?

Boolean algebra is the algebra of truth values. Instead of ordinary numbers, it works with true/false or 1/0 values and uses logical operations such as AND, OR, and NOT. It is the language used in digital logic, circuit design, and many logic-class exercises.

How does this calculator simplify an expression?

It evaluates the complete truth table for the expression, then finds a compact equivalent form that keeps every true row and excludes every false row. That makes the simplified answer grounded in the actual output rather than just in a guessed rewrite rule.

Which operators can I use?

You can use AND, OR, NOT, XOR, XNOR, NAND, NOR, and IMPLIES. The calculator also accepts common symbols such as &, |, !, ~, ^, ∧, ∨, ⊕, +, and * for the basic gates, plus postfix complement notation such as A'.

Can I use parentheses and nested expressions?

Yes. Parentheses are the best way to group sub-expressions and remove ambiguity. The calculator respects standard precedence, but parentheses make the intended logic easier to read and verify.

How many variables can I enter?

This page is designed for up to four distinct variables. That covers one-variable through four-variable expressions while keeping the truth table small enough to read comfortably.

What is the difference between a minterm and a maxterm?

A minterm is a row where the expression equals 1, while a maxterm is a row where it equals 0. Minterms are used in sum-of-products form, and maxterms are used in product-of-sums form.

Is the simplified answer always unique?

Not always. Different but equivalent minimal expressions can exist, especially when more than one grouping gives the same number of literals. The important part is that the result stays logically equivalent to the original expression.

What does it mean if the result is 1 or 0?

A result of 1 means the expression is a tautology, so it is true for every input combination. A result of 0 means the expression is a contradiction, so it is false for every input combination.

Should I use this instead of a Karnaugh map?

For study and quick checking, yes. A Karnaugh map is still useful for manual grouping, especially when you are learning the technique or working with don't-care conditions, but this calculator gives you a fast equivalent form, the full truth table, and mismatch rows for an answer check without needing to draw the map yourself.

Can this calculator check if two Boolean expressions are equivalent?

Yes. Enter the original expression in the main field and a proposed simplification in the comparison field. The calculator evaluates both expressions on the same input rows and reports whether they are equivalent.

What is the difference between SOP and POS?

SOP means sum of products, where OR combines product terms that make the function true. POS means product of sums, where AND combines sum clauses tied to the false rows. Both can describe the same Boolean function, but courses and design notes often ask for one form explicitly.

Why does the calculator show mismatch rows?

Mismatch rows make an equivalence failure easier to fix. Instead of only saying two expressions are not equal, the calculator shows which input combinations produce different outputs, so you can find the missing term, extra term, or misplaced negation.

Also in Functions

Related

More from nearby categories

These related calculators come from the same leaf category, nearby sibling categories, or the same top-level topic.