Strugging with truth tables? I made this app just for you - quickly generate truth tables from any boolean logic statement - it also includes an interactive tutor that teaches you how to solve truth tables step-by-step!
Truth Table Solver
This truth table generator can show you the results of boolean logic statements quickly.
Examples
De Morgan's Law (Wikipedia)
Satisfiability (3-CNF)
- (A | B | C) & (A | ~B | ~C) & (~A | ~B | C)
- (A | ~B | ~C) & (~A | ~B | ~C) & (A | B | ~C) & (A | ~B | C)
Full Adder
Usage
Operators in order of evaluation. All identifiers must be uppercase.
- 1: true
- 0: false
- ~: not
- +: xor
- &: and
- |: or
- ->: if
- <->: equivalence
- /: separator
Implementation
This truth table generator is written in ruby by Samuel Williams. It uses a unique parsing algorithm which supports arbitrary complexity operators, precedence and runs in linear time.
The source code is available here.
Follow Me