Truth tables, connectives, tautologies, and equivalence
Every statement is either true or false, and a handful of connectives decide how those truth values combine. Pick formulas, flip inputs, and watch the truth tables fill in.
Pick a formula and read its result column. All true means atautology, all false a contradiction, and a mix a contingency.
Select a formula to generate its truth table. Tautologies are always true; contradictions always false.
Propositional logic is the study of how truth values combine through logical connectives: AND, OR, NOT, IMPLIES, and IF-AND-ONLY-IF. Every compound proposition has a definite truth value determined entirely by the truth values of its atomic parts. This is the foundation of all formal reasoning.
A truth table lists every possible combination of truth values for the variables and evaluates the formula for each. If the result column is all true, the formula is a tautology. If all false, a contradiction. Otherwise, it is a contingency.
Key insight: Truth tables provide a mechanical, foolproof method for determining validity. The cost is exponential: n variables require 2ⁿ rows.
Click the inputs on each card to toggle them. Watch IMPLIES closely: it is false only when the first input is true and the second is false.
Click the colored circles to toggle inputs between True and False. The output updates automatically based on the connective.
Each logical connective has a precise truth-functional definition. The most counterintuitive is material implication (→): "if P then Q" is false only when P is true and Q is false. A false premise implies anything. Toggle inputs to build intuition for each connective.
Key insight: Material implication differs from everyday "if-then" because it has no causal requirement. "If 2+2=5 then the moon is made of cheese" is logically true.
Choose Formula A and Formula B and compare their columns row by row. If they match on every row, the two formulas are equivalent.
Compare two formulas row by row. Try p → q vs ¬p ∨ q (equivalent), or ¬(p ∧ q) vs ¬p ∨ ¬q (De Morgan).
Two formulas are logically equivalent if they have the same truth value under every assignment. For example, p → q is equivalent to ¬p ∨ q. Compare truth tables column by column to verify equivalences or find counterexamples.
Key insight: De Morgan's laws, double negation, and implication elimination are among the most important equivalences. They form the basis for converting formulas into normal forms.
Spot a mistake or have an idea?