Truth Table Generator
This page contains a program that will generate truth tables for formulas of propositional logic. You can enter multiple formulas separated by commas to include more than one formula in a single table (e.g. to test for entailment). Below you can select which symbols to use for the truth-values and connectives, the style of the table (full table, main connective only, plain text, or LaTeX output), and (by special request!) two-valued or different types of three-valued tables.
Truth-Values:
Connectives:
Table Style:
Type:
Symbols: use the following keyboard symbols in your input for the various logical connectives:
| ~ | for negation |
| & | for conjunction |
| v | for disjunction |
| > | for the conditional |
| < > | for the biconditional |
| # | for absurdity/falsum |
| | | for NAND (aka the Sheffer Stroke) |
| ! | for NOR (Wittgenstein's Sheffer Stroke) |
Here are some examples of well-formed inputs the program will accept:
- ~A
- (A & B)
- (A & (~B > C))
- (# > (B v ~A))
- (A|B) <> ~(A & B)
- (A <> (B v C)), A, (~B > C)
The source code is available on GitHub, just click the icon at the top right corner of the page.