Boolean Algebra Calculator
Simplify bounded Boolean expressions to an exact minimal Sum-of-Products form.
Input
Result
Initializing.
Method
The shared parser builds an AST, evaluates every row, collects minterms, runs exact Quine-McCluskey combination, and selects a cover by fewest terms, then literals, then lexical order. Equivalence is verified across the full table; at most six variables.
Limits
Integer-only arithmetic is exact within documented bounds. Logic expressions are limited to 300 characters, 150 tokens, depth 20, six variables, and 64 truth-table rows.