Test Boolean expressions with tables and canonical logic forms. Review variables, operators, and truth patterns instantly. Make complex reasoning checks easier every single time.
| Expression | Variables | Sample Assignment | Expected Output |
|---|---|---|---|
| (A & B) | !C | A, B, C | A=1, B=1, C=0 | 1 |
| (A xor B) -> C | A, B, C | A=1, B=0, C=1 | 1 |
| (A nand B) <-> D | A, B, D | A=1, B=1, D=0 | 1 |
| !(A | B) | (C & D) | A, B, C, D | A=0, B=0, C=1, D=1 | 1 |
A=1, B=0, C=1.It evaluates Boolean expressions, builds a full truth table, counts true and false outputs, and generates canonical SOP and POS forms from the resulting rows.
You can use NOT, AND, OR, XOR, NAND, NOR, implication, and equivalence. Symbol and word-style inputs are both supported for easier entry.
This version supports up to six variables. That keeps the truth table readable while still covering many advanced classroom and design problems.
Minterms identify row numbers where the expression becomes true. Maxterms identify row numbers where it becomes false. They are useful for canonical forms.
Canonical SOP is a sum of products form created from all truth table rows that output 1. Each row contributes one minterm.
Canonical POS is a product of sums form created from all truth table rows that output 0. Each false row contributes one maxterm.
It lets you test one exact variable combination quickly. This is useful when checking a design state, homework step, or a single expected condition.
Yes. You can download the generated truth table as CSV and save the full displayed report as a PDF for sharing or documentation.
Important Note: All the Calculators listed in this site are for educational purpose only and we do not guarentee the accuracy of results. Please do consult with other sources as well.