Truth Table Generator
Builds the full truth table for up to 8 variables, with a column per sub-expression so you can see where a row turns. Classifies the formula as tautology, contradiction or contingency, lists the minterms and maxterms, and copies out as CSV, LaTeX or Markdown.
Related tools
All Discrete maths & graphs tools →Open Truth Table Generator and you get an answer straight away, with no account to create. Its place is under Discrete maths & graphs; Bitwise Calculator and Karnaugh Map (K-Map) Solver answer the questions closest to this one.
How to use it
- Open the tool — no signup or install needed.
- Enter your input or adjust the available options.
- Get your result instantly, then copy or download it.
Frequently asked questions
What is Truth Table Generator?
Builds the full truth table for up to 8 variables, with a column per sub-expression so you can see where a row turns. Classifies the formula as tautology, contradiction or contingency, lists the minterms and maxterms, and copies out as CSV, LaTeX or Markdown.
When would I actually use this?
Anything modelled as points and connections: a shortest route, a network's capacity, a schedule with dependencies, or a circuit reduced to its logic.
What is the most common mistake?
Assuming a shortest path stays shortest when a weight changes sign. Negative edges break the greedy argument Dijkstra rests on, and the algorithm returns a confident wrong answer rather than an error.
How is Truth Table Generator different from Bitwise Calculator?
They sit next to each other but answer different questions. Bitwise Calculator: aND, OR, XOR, NOT and shifts in binary, decimal or hex, at 8, 16, 32 or 64 bits, with the bit-by-bit diagram and the result in all three bases. Computed with BigInt, so the 64-bit answers are right where JavaScript's own 32-bit operators would silently truncate. Pick whichever matches what you're starting from — both are free.
Is there a tool for the next step?
Karnaugh Map (K-Map) Solver is the closest one after this: Minimize a boolean function with the Quine–McCluskey algorithm: enter minterms, maxterms or a truth table and get the minimal SOP or POS, prime implicants and literal count.
What else is worth having open alongside it?
Logic Gate Simulator and Traveling Salesman Solver — they come up in the same task often enough to be worth a second tab.
Where do the figures come from?
The algorithms are the textbook ones and their results are exact for the graph you enter. What varies is cost: several of these problems have no known efficient solution, so large inputs are answered by heuristic and the tool says when that is the case.