Example 1 — Build a three-input table
Show the steps and the answer
Count the rows: 3 inputs give rows.
Writing the count first means a missing row shows up straight away.
List (A, B, C) by counting in binary from FFF to TTT, and add a column for : it is false only in rows FFF and FFT.
OR is false only when both of its inputs are false, so only the two rows with and both false get F.
Add a column for : true in the four rows where is F (FFF, FTF, TFF, TTF).
NOT flips the column, so the helper column is ready for the final AND.
AND the two helper columns: FFF gives ; FTF, TFF and TTF give ; the four rows with true give F.
AND is true only where both helper columns are true, which happens in three rows.
Answer: 8 rows; the expression is true in 3 of them: (A, B, C) = (F, T, F), (T, F, F), (T, T, F).
Takeaway: Count rows first, then build helper columns one operator at a time so each final output is a simple lookup.