โ Discrete Mathematics learning pathDiscrete Mathematics ยท Module 1 of 10
Propositional logic
Statements, connectives and truth tables.
๐ Key ideas
- A proposition is a statement that is either true or false.
- Connectives: NOT, AND, OR, implication (p -> q) and biconditional (p <-> q).
- p -> q is false only when p is true and q is false.
- A tautology is always true; a contradiction is always false.
- The contrapositive (not q -> not p) is equivalent to p -> q; the converse (q -> p) is not.
๐ก Real-life example: An implication is a promise: "If it rains, I will bring an umbrella" is broken only if it rains and I do not bring one.
PropositionStatement that is true or false
TautologyFormula true in every case
Contrapositivenot q -> not p
Biconditionalp <-> q, true when both have the same value