Propositional Logic
The algebra of true and false: how AND, OR, and NOT combine statements, how truth tables prove what a compound claim really does, and the equivalences (like De Morgan's laws) that let you rewrite and negate conditions with confidence.
- Connectives: AND, OR, NOT AND is true only when both parts are; OR is true when at least one is (the inclusive or that trips people up); NOT flips. The three operators that build every compound statement.
- Truth Tables A truth table lists every possible combination of true/false for the inputs and shows the result — the foolproof way to know exactly what a compound statement does, and to spot tautologies and contradictions.
- Equivalences & De Morgan's Laws Two statements are logically equivalent when they have identical truth tables. De Morgan's laws — how to correctly distribute a NOT across AND/OR — are the equivalence you'll use most when negating and simplifying conditions.