Truth Table Generator

How to use

1. 1Type one or more boolean expressions in the input fields. Use AND, OR, NOT, XOR, NAND, NOR, XNOR, IMPLIES, IFF, or any of their symbol forms.
2. 2Variables can be any identifier, like A, B, P_1, or Cin. Identifiers are case-sensitive.
3. 3Click a preset (Basic logic, De Morgan, Implication, Three variables, Half adder, Full adder) to load a ready-made example.
4. 4Switch the value format (T / F, 1 / 0, true / false) and the row order (F first or T first) to match your textbook or your homework convention.
5. 5Read the truth table on the right. Each expression column is tagged as a tautology, contradiction, or contingency.
6. 6Turn on Show canonical form to see the minterm and maxterm indexes and the SOP and POS expansions for each expression.
7. 7Use Copy Markdown table, Copy CSV, or Copy summary to drop the result into a homework write-up, a wiki, a pull request, or a spreadsheet.

About this tool

Truth Table Generator turns any boolean expression into the table that classroom logic, digital design, and discrete math courses are built on. Type one expression or many side by side and the tool tokenizes the input, parses it with a small recursive-descent grammar (precedence NOT, AND/NAND, XOR/XNOR, OR/NOR, IMPLIES, IFF), discovers every free variable, and enumerates all 2^N rows from all-false to all-true (up to 12 variables and 4096 rows). The operator vocabulary covers the symbols people actually type in textbooks, papers, and Verilog or Python expressions: AND can be written AND, &, &&, *, or the middle dot ·; OR can be written OR, |, ||, or +; NOT can be written NOT, !, ~, or ¬; XOR can be written XOR, ^, ⊕, or !=; NAND, NOR, and XNOR are spelled out or given as ⊼, ⊽, and ≡; implication accepts ->, =>, →, ⇒ and the biconditional accepts <->, <=>, IFF, ==, ↔, ⇔. Constants 1, 0, TRUE, FALSE, T, F all work and parentheses set explicit grouping. Every row of the table shows the variables in the input order and one column per expression, with optional T/F, 1/0, or true/false formatting and ascending or descending order so the layout matches whatever convention your class or textbook uses. Each expression column carries a live tag: tautology (every row true), contradiction (every row false), or contingency (mixed), plus minterm and maxterm index lists and the canonical sum-of-products (Σm) and product-of-sums (ΠM) form built from those indexes (useful for Karnaugh-map setup and gate-level synthesis). When two expressions evaluate to the same column they are flagged as logically equivalent, which is the fastest way to verify De Morgan's laws, double negation, distribution, absorption, and other propositional identities. One-click Copy buttons produce a Markdown table ready to paste into a homework PDF or pull request, a CSV ready for a spreadsheet, and a plain-text summary with classifications and equivalences. Everything runs locally in your browser; the expressions you type stay on your device.

Free to use. Works in your browser. No signup, no login.