Runs entirely in your browser - no upload, no sign-up.
Precedence: NOT, AND, XOR, OR, implication, then equivalence. Parentheses override it.
A truth table generator evaluates a Boolean expression for every possible combination of its variables. Enter logic with AND, OR, NOT, XOR, implication, or equivalence to see each true and false result, identify its minterms, and tell whether the expression is a tautology, contradiction, or contingent statement.
Type variable names and operators, or choose a preset such as De Morgan's law.
The table updates live with every true and false assignment for up to eight variables.
See whether the expression is always true, always false, or contingent, and review its minterm and maxterm indices.
Copy the tab-separated table into a spreadsheet, notes app, or assignment.
The parser accepts word operators such as AND, OR, NOT, XOR, IMPLIES, and IFF, plus familiar symbols such as &, |, !, ^, ->, and <->. NAND, NOR, constants, multi-letter variable names, and parentheses also work.
Your expression is parsed and evaluated locally with purpose-built JavaScript. It is never sent to a calculation service, and the parser does not run your input as code.
No. Parsing, row generation, and evaluation all happen locally in your browser. The tool does not send your expression or generated table to a server, so you can work with private exercises, circuit conditions, or application logic without uploading them.
Yes. The generator is free to use with no account, paywall, or download. Enter an expression, inspect every row, and copy the finished table as often as needed.
The generator accepts up to eight distinct variables, which produces at most 256 rows. A truth table doubles in size with each added variable, so this limit keeps the output responsive and readable on ordinary desktop and mobile browsers.
You can use NOT, AND, NAND, XOR, OR, NOR, implication, and equivalence. Type words such as AND and IFF, or symbols including !, &, |, ^, ->, and <->. The constants true, false, 1, and 0 are also accepted.
NOT is evaluated first, followed by AND or NAND, XOR, OR or NOR, implication, and then equivalence. Implication groups from right to left. Parentheses take priority over every operator, so use them whenever the intended grouping may be unclear.
A tautology is true on every row of its truth table, such as P OR NOT P. A contradiction is false on every row, such as P AND NOT P. An expression with both true and false rows is classified as contingent.
Material implication is false only when its premise P is true and its conclusion Q is false. In every row where P is false, the conditional is true. This matches the equivalent expression NOT P OR Q and is the standard definition used in propositional logic.
