Truth tables
Evaluate formulas under all Boolean valuations. A satisfying row witnesses satisfiability; a row that makes the premises true and the conclusion false is a countermodel to an inference.
Scope. Propositional formulas under Boolean semantics, up to six variables — 64 rows. The method is the same for any finite number of variables; the app stops well before the arithmetic does.
Calculate
Calculate a single formula, or enter an inference with ∴ and look for a counterexample row.
Text tree
Work it yourself
Choose a level to begin.
Using it
Separate formulas with commas, semicolons or new lines, and introduce a
conclusion with ∴ or ⊨. For an inference, the app conjoins the premises
and the negation of the conclusion. It prints this SAT formula above the
table. The columns show variables, the formulas being conjoined, and the
final SAT value. Next evaluates one subformula at a time beside the table;
“Row calculations” records the intermediate values. Row buttons jump to a
valuation. A marked row with SAT value 1 is a countermodel.
In Work it yourself, enter a formula or inference, identify its variables and row count, and match compound tree nodes to the table columns. Fill in the truth-values and Check. Incorrect entries remain editable.
In the book
- Chapter 5 · Truth tables sets out the method and what it guarantees.
- Chapter 5 · Searching the table treats validity as a search for one bad row.
- Chapter 4 · Boolean models supplies the valuations the rows enumerate.