How to use it
- Type or paste the expression.
- Choose T/F or 1/0 and whether to show only the result column or every sub-expression.
- Copy the table. The line under it says if the expression is a tautology, a contradiction or neither.
How it works
The expression is parsed into a tree with the precedence rules above, then evaluated once for each of the 2ⁿ combinations of its n variables. Operators are shown in their standard symbols in the column headings, so “not A and B” appears as ¬A ∧ B.
Worked example
p -> q (if p then q) with 1/0 values:
- p = 0, q = 0 gives 1
- p = 0, q = 1 gives 1
- p = 1, q = 0 gives 0
- p = 1, q = 1 gives 1
An implication is false only when the premise is true and the conclusion is false.
Tips
- Use the step columns to check a long formula part by part.
- To test two formulas for equivalence, join them with iff; a tautology means they always agree.
- De Morgan’s law: not (A and B) gives the same table as (not A) or (not B).