Parse and evaluate a boolean expression, enumerate all input combinations, and identify tautologies.
Boolean algebra deals with expressions over binary variables using AND, OR, NOT and related operators. This calculator evaluates the expression for every possible input combination to determine satisfiability and tautology status.
De Morgan's Laws
NOT(A AND B) = (NOT A) OR (NOT B); NOT(A OR B) = (NOT A) AND (NOT B)
An expression is satisfiable if there exists at least one assignment of truth values to its variables that makes it true.
The truth table shows the full table; this focuses on classifying the expression (tautology, satisfiable, contradiction) and counting satisfying assignments.