Boolean Truth Table Calculator
Build a complete truth table for an expression with variables A–F.
Enter a valid Boolean expression of up to 256 characters using A–F, 0/1 and the listed operators.
Aliases: * = AND (&), + = OR (|), ~ = NOT (!). Precedence: !, &, ^, |, ->, <->. Up to 256 characters and variables A–F; lowercase is accepted. Constants 0/1 and parentheses are supported.
Calculation and assumptions
0≡⊥; 1≡⊤; !≡¬; &≡∧; ^≡⊕; |≡∨; ->≡→; <->≡↔; N=2ⁿ.
Use variables A–F, constants 0/1 and parentheses. Precedence from highest to lowest: !, &, ^, |, ->, <->. Implication associates right; the other binary operators associate left. && and || are aliases. All assignments are listed; no expression is executed as code.
Every assignment is listed and results are exact Boolean 0/1 values. Up to six variables give at most 64 rows.
Aliases: * = AND (&), + = OR (|), ~ = NOT (!). Precedence: !, &, ^, |, ->, <->. Up to 256 characters and variables A–F; lowercase is accepted. Constants 0/1 and parentheses are supported.
Frequently asked questions
How is the result calculated?
0≡⊥; 1≡⊤; !≡¬; &≡∧; ^≡⊕; |≡∨; ->≡→; <->≡↔; N=2ⁿ.
What assumptions apply?
Use variables A–F, constants 0/1 and parentheses. Precedence from highest to lowest: !, &, ^, |, ->, <->. Implication associates right; the other binary operators associate left. && and || are aliases. All assignments are listed; no expression is executed as code.
How precise are the results?
Every assignment is listed and results are exact Boolean 0/1 values. Up to six variables give at most 64 rows.