Elysia Tools
Navigation
Math & Numbers
Complete truth table (≤ 6 variables, 64 rows) with alphabetical variable order, per-row function values, and canonical Σm/ΠM forms.
Execution
Fill in the form, run the tool, and review the result in one place.
Samples
Related
Tool usage guide
Generate complete truth tables for Boolean expressions with up to 6 variables (A–F) and up to 64 evaluation rows. The tool supports standard switching-algebra notation, orders inputs alphabetically, computes function values per row, and derives canonical sum-of-minterms (Σm) and product-of-maxterms (ΠM) representations.
Background
Designing an AND-OR-Invert 2-to-1 multiplexer circuit and needing to confirm the input-to-output mapping.
Problem
Verify how selection variable A switches output F between inputs B and C.
How to use
Enter the expression AB + A'C into the Boolean expression field.
AB + A'COutcome
Displays an 8-row truth table for variables A, B, and C with canonical forms Σm(1, 3, 6, 7) and ΠM(0, 2, 4, 5).
Background
Implementing an odd-parity generator for 3-bit data words prior to bus transmission.
Problem
Check that the function outputs 1 whenever an odd number of input bits are high.
How to use
Input the chained XOR expression A ^ B ^ C into the tool.
A ^ B ^ CThe generator accepts + for OR, ^ for XOR, ! or ~ or ' for NOT, and ·, *, &, or direct variable juxtaposition for AND.
You can use up to 6 unique variables (A through F), generating a truth table of up to 64 rows.
All detected variables are sorted and evaluated in alphabetical order (e.g., A, B, C).
Σm represents the ON-set (row indices where F = 1), while ΠM represents the OFF-set (row indices where F = 0).
Yes, placing variables side by side such as AB or A'C evaluates as a logical AND operation.
Outcome
Produces an 8-row table showing F = 1 at rows 1, 2, 4, and 7, yielding canonical form Σm(1, 2, 4, 7) = ΠM(0, 3, 5, 6).