Logic Workbench
Build a truth table and test an argument against every assignment.
See every truth value.
Enter one proposition. Every row and subexpression comes from the exact logic engine.
contingent
| P | Q | P → Q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | T |
| F | F | T |
Read the notation
- ∼P
- not P
- P ∧ Q
- P and Q
- P ∨ Q
- P or Q, inclusive
- P → Q
- if P, then Q; P is sufficient for Q
- P ↔ Q
- P if and only if Q