Boolean Algebra Calculator

A boolean algebra calculator evaluates and simplifies logical expressions using the rules of boolean algebra.

It generates truth tables showing every input/output combination, identifies minterms and maxterms, and applies minimization algorithms like Quine-McCluskey to find the simplest equivalent expression.

This calculator accepts multiple notation styles:

• AND (*, ·, AND, &&)
• OR (+, OR, ||)
• NOT (', !, ~, NOT)
• XOR (^, XOR)
• NAND
• NOR
• XNOR

Variables are single letters A through D. Parentheses are supported for grouping.

Examples: A*B+C', (A OR B) AND NOT C, A NAND B.

To simplify a boolean expression, apply the algebraic laws that govern binary logic until no further reduction is possible.

Start with the identity and complement laws (A + A' = 1, A · A' = 0), then use absorption (A + A·B = A) and distribution to factor common variables. De Morgan's theorems convert complemented groups, and the consensus theorem removes redundant terms. For a systematic result, list minterms and combine those differing by one bit.

As George Boole introduced in his 1854 work, per Encyclopaedia Britannica, these laws form a closed algebra where every expression can be reduced to a minimal form (not always unique). This calculator shows each rule applied in order.

A truth table lists every possible combination of input variables and the resulting output, giving a complete definition of a boolean function.

For n variables there are 2^n rows, so two variables produce 4 rows and four variables produce 16 rows; conversely, the number of variables equals the base-2 logarithm of the row count, which our logarithm calculator can evaluate for larger functions. Order the inputs in standard binary counting sequence (00, 01, 10, 11) and evaluate the expression for each row.

According to the IEEE standard for logic operations, the output column fully characterizes the function regardless of how the expression is written. This tool auto-generates the truth table, then derives minterms (rows equal to 1) and maxterms (rows equal to 0) directly from it.

Sum of Products (SOP) expresses a boolean function as an OR of AND terms, one minterm for each row where the output equals 1. Product of Sums (POS) is the dual: an AND of OR terms, one maxterm for each row where the output equals 0.

Both are canonical forms describing the same function, and either can be minimized. Digital design textbooks such as those referenced by All About Circuits note that SOP maps naturally to two-level AND-OR gate networks, while POS maps to OR-AND networks.

Choose whichever yields fewer gates for your circuit. The calculator outputs both canonical forms plus the minimized SOP for comparison.

A Karnaugh map is a grid that arranges truth-table outputs so that physically adjacent cells differ by exactly one variable, using Gray-code ordering (00, 01, 11, 10).

This adjacency lets you visually group 1s in rectangular blocks of powers of two (1, 2, 4, 8) to eliminate variables and read off a minimal SOP.

Named after Maurice Karnaugh, who published the technique in 1953, K-maps are practical for up to four or five variables before adjacency becomes hard to track. This calculator renders a color-coded map highlighting each minterm so you can confirm the algorithmic result by eye.

The Quine-McCluskey method is a tabular procedure that guarantees a minimal Sum of Products, making it more reliable than Karnaugh maps for functions with many variables.

It lists every minterm in binary, groups them by the number of 1-bits, then repeatedly combines terms that differ by a single bit, marking the eliminated position with a dash. Terms that cannot combine further are prime implicants. A prime implicant chart then selects the smallest set of essential prime implicants covering all minterms.

Because it is algorithmic, it scales where visual methods fail, which is why it underpins many automated logic-synthesis tools used in modern EDA workflows.

De Morgan's theorems state that (A·B)' = A' + B' and (A+B)' = A'·B' — complementing a group flips the operator and inverts each variable. These laws are the basis for converting any circuit into NAND-only or NOR-only form.

NAND and NOR are called universal gates because any boolean function can be built entirely from either one, a property widely used in chip fabrication to reduce the number of transistor types. As standard digital-logic references note, this universality simplifies manufacturing and testing.

The calculator applies De Morgan's laws automatically when you enter NAND, NOR, or XNOR operators, showing the equivalent AND/OR/NOT expansion.

Boolean algebra is used far beyond textbooks. Hardware engineers apply it to minimize gate counts in combinational logic for CPUs, FPGAs, and ASICs, directly cutting power draw and chip area.

Software developers use the same laws to simplify conditional statements, optimize compiler branch logic, and write clearer if-conditions. Database engineers translate query filters into boolean predicates, and search engines evaluate AND/OR/NOT operators the same way.

According to computer-science curricula summarized by Khan Academy, boolean logic is foundational to how all digital information is processed. This calculator supports up to four variables, covering the vast majority of combinational-logic exam problems and everyday simplification tasks.

Simplifying boolean expressions invites several common errors:

• The most frequent error is confusing OR (+) with arithmetic addition — in boolean algebra 1 + 1 = 1, not 2.
• Another is dropping parentheses, which changes operator precedence and produces a different function; NOT binds tightest, then AND, then OR.
• Students often stop simplifying too early, missing a consensus term or an absorption that removes a whole variable, or too late, over-factoring into a longer expression.
• Misordering Karnaugh-map columns (using binary 00, 01, 10, 11 instead of Gray code 00, 01, 11, 10) breaks adjacency and yields wrong groupings.

Always verify the simplified result against the original truth table, which this calculator does automatically to catch these mistakes.

When an expression mixes operators without full parentheses, boolean algebra evaluates NOT first, then AND, then OR, mirroring how multiplication precedes addition in ordinary arithmetic.

So A + B·C means A OR (B AND C), and A·B' means A AND (NOT B), not (A AND B)'. XOR is typically treated at the same level as AND or lower, so parentheses are recommended whenever XOR is combined with other operators to avoid ambiguity.

This precedence follows the conventions used across digital-logic references and IEEE notation. To stay safe, wrap any sub-expression whose grouping you care about in parentheses; the calculator respects explicit parentheses over default precedence every time.