Simulators
Truth table maker
Type a formula such as not (A and B) or p -> q. The truth table maker lists every row, with a column for each part of the formula, and says whether the formula is a tautology, a contradiction or neither.
The simulator
Truth table maker: how to use it
It understands not, and, or, xor, implies (->) and if and only if (<->), written as words or as symbols (¬, ∧, ∨, ⊕, →, ↔), and the constants T and F.
Lessons that use it
- Propositions and truth tables (Discrete Math)Statements that are true or false, the connectives not, and, or, xor, implies and if-and-only-if, and truth tables that list every case.
- Logical equivalence (Discrete Math)Tautologies and contradictions, when two formulas mean the same, the laws of logic (De Morgan's and more), and the contrapositive, converse and inverse.
- Bits, logic gates and truth tables (Digital Logic)Why computers use two voltage levels, the seven basic logic gates, and truth tables that list a gate's output for every input.
See also
- CPU scheduling simulator
- Page replacement simulator
- Banker's algorithm simulator
- Disk scheduling simulator
- Race condition simulator
- Gradient descent simulator
- K-means clustering simulator
- Subnet calculator
- Sliding window simulator
- TCP congestion control simulator
- Karnaugh map solver
- Flip-flop simulator
- Ripple-carry adder
- Cache simulator
- 5-stage pipeline simulator