What a truth table actually enumerates
A truth table lists every possible combination of input values for a boolean expression, alongside the resulting output for each — an exhaustive, row-by-row specification of exactly what the expression computes, with no ambiguity about any edge case.
A | B | A AND B
0 | 0 | 0
0 | 1 | 0
1 | 0 | 0
1 | 1 | 1
For AND, only the row where both inputs are 1 produces a 1 — this table completely and unambiguously defines the AND operation, without needing any prose explanation.
Why row count doubles with every variable
Each additional boolean variable doubles the number of possible input combinations, since each existing combination now needs to be paired with both possible values (0 and 1) of the new variable: 2 variables → 4 rows, 3 variables → 8 rows, 4 variables → 16 rows, and so on — 2ⁿ rows for n variables. This exponential growth is exactly why truth tables become unwieldy past 4-5 variables — a 6-variable expression already needs 64 rows, difficult to read or verify by eye even though the table itself is perfectly systematic.
Common patterns worth recognizing
| Expression | Output is 1 when... |
|---|---|
| A AND B | Both inputs are 1 |
| A OR B | At least one input is 1 |
| A XOR B | Exactly one input is 1 (not both, not neither) |
| NOT A | A is 0 |
| A NAND B | NOT (A AND B) — 1 in every case except both-1 |
XOR is worth calling out specifically: it's true exactly when the inputs differ, which is why it's used constantly for parity checks and simple difference detection in digital logic.
Why truth tables matter beyond just verifying an expression
Beyond confirming what an expression computes, a truth table is the starting point for simplification — a Karnaugh map (see Karnaugh Map Simplification Explained) is really just a truth table rearranged so that logically adjacent rows sit physically next to each other, making groupings visually obvious. Generating the complete, correct truth table first is the foundation every subsequent simplification step builds on — an error in the truth table propagates directly into an incorrect simplified expression.
Common mistakes
- Manually enumerating rows and missing a combination. Especially past 3 variables, it's easy to skip or duplicate a row by hand — a systematic, generated table avoids this entirely.
- Misreading which rows an operator applies to. Confusing AND and OR's "true" conditions is a common early mistake — AND requires all inputs true, OR requires at least one.
- Assuming a truth table scales linearly with variable count. It's exponential (2ⁿ), not linear — this is exactly why simplification techniques like Karnaugh maps matter once past a handful of variables.
FAQ
How many rows does a truth table have for n variables?
Exactly 2ⁿ — every additional variable doubles the total number of input combinations that must be enumerated.
What's the difference between XOR and OR in a truth table?
OR is true when at least one input is true (including when both are true); XOR is true only when exactly one input is true, excluding the both-true case — they agree on every row except when both inputs are 1.
Why do truth tables become impractical for many variables?
Because the row count grows exponentially (2ⁿ) — a 6-variable expression already needs 64 rows, which is difficult to read or verify manually even though the table remains perfectly systematic.
Generate a complete truth table for any boolean expression instantly with the Truth Table Generator — entirely client-side.