Proposition: A declarative statement that is either definitively True (T) or False (F), but not both simultaneously.
Tautology vs. Contradiction: A tautology is a compound proposition that evaluates to True for all possible truth values of its propositional variables (e.g., p∨¬p); a contradiction evaluates to False in every circumstance (p∧¬p).
Modus Ponens: A foundational rule of inference stating: If premise p is true and implication p→q is true, then conclusion q must be true:
Swipe to see the full formula↔
p,p→q⟹q
Proof by Contradiction (Reductio ad Absurdum): A proof method where to prove proposition p, one assumes its negation ¬p is true and derives a logical contradiction (r∧¬r), proving p must be true.
Part 2: Structural Frameworks (10 Marks)
Rules of Inference Matrix for Mathematical Proofs
Rule of Inference
Tautological Formulation
Name of Rule
p, p -> q
[p and (p -> q)] -> q
Modus Ponens
~q, p -> q
[~q and (p -> q)] -> ~p
Modus Tollens
p -> q, q -> r
[(p -> q) and (q -> r)] -> (p ->r)
Hypothetical Syllogism
p or q, ~p
[(p or q) and ~p] -> q
Disjunctive Syllogism
p
p -> (p or q)
Addition
p and q
(p and q) -> p
Simplification
p or q, ~p or r
[(p or q) and (~p or r)] -> (q or)
Resolution
Part 3: Distinction Tables
Basis of Comparison
Direct Proof
Proof by Contraposition
Premise Assumption
Assume p is directly True
Assume ¬q (negation of conclusion) is True
Derivation Target
Direct deductive steps leading to q
Deductive steps leading to ¬p
Equivalence Basis
Follows natural implication p→q
Relies on logical equivalence p→q≡¬q→¬p
Best Applied When
Hypothesis p contains simple algebraic structure
Negation ¬q reveals clear structural factors
Part 4: Worked Problems & Exam Traps
Worked Proof: Irrationality of 2 by Contradiction
Assume the contrary: Suppose 2 is rational.
Swipe to see the full formula↔
2=ba(a,b∈Z,b=0,gcd(a,b)=1)
Square both sides:
Swipe to see the full formula↔
2=b2a2⟹a2=2b2
Since a2 is even, a must be even. Let a=2k.
Swipe to see the full formula↔
(2k)2=2b2⟹4k2=2b2⟹b2=2k2
Since b2 is even, b must also be even.
Contradiction: Both a and b share a common factor of 2, contradicting gcd(a,b)=1.
Swipe to see the full formula↔
∴2 is irrational.
TU Exam Trap: Do not confuse the converse (q→p) or inverse (¬p→¬q) with the contrapositive (¬q→¬p). Only the contrapositive is logically equivalent to the original conditional statement p→q.