Logic Tricks and Applications
Your Name
October 14, 2025
Boolean Algebra Tricks from Your Teacher
This guide collects the key simplification tricks, property applications, and reasoning
shortcuts from your teacher’s logic cases. Each law includes a real-life application.
1 Idempotent Law
Statement:
p∨p=p
p∧p=p
Use: Collapse repeated literals.
Example:
(p ∨ p ∨ q) = p ∨ q
Application: If a statement is ”If I study or I study, then I pass”, it simplifies to ”If I
study, then I pass”.
2 Complementary Law
Statement:
p ∨ ¬p = 1 (tautology)
p ∧ ¬p = 0 (contradiction)
Use: p and ¬p together always yield a fixed result.
Example:
(p ∨ ¬p ∨ q) = 1
Application: ”Either I go or I don’t go” is always true, while ”I go AND I don’t go” is
always false.
1
3 Absorption Law
Statement:
p ∨ (p ∧ q) = p
p ∧ (p ∨ q) = p
Use: Simplifies expressions where a variable appears alone and within a group.
Example:
q ∨ (q ∧ r) = q
Application: ”It rains, or it rains and it’s cold” just depends whether it rains.
4 Associative and Commutative Laws
Statement:
(p ∨ (q ∨ r)) = (q ∨ p ∨ r)
Use: Rearrangement helps spot simplifications and combine like terms.
Example:
(p ∨ q) ∨ (¬p ∨ r) = (p ∨ ¬p) ∨ (q ∨ r) = 1 ∨ (q ∨ r) = 1
Application: Quickly check for tautology by regrouping terms.
5 Distributive Laws
Statement:
p ∨ (q ∧ r) = (p ∨ q) ∧ (p ∨ r)
p ∧ (q ∨ r) = (p ∧ q) ∨ (p ∧ r)
Use: Expand or factor expressions; useful for CNF/DNF conversions.
Example:
p ∨ (¬q ∧ r) = (p ∨ ¬q) ∧ (p ∨ r)
Application: Turn logic formulas into clausal form for resolution.
6 Double Negation / Involution
Statement:
¬(¬p) = p
Use: Simplify formulas with nested negations.
Example:
¬(¬(p ∨ q)) = p ∨ q
Application: ”It is not true that I’m not studying or passing” is ”I’m studying or
passing”.
2
7 De Morgan’s Laws
Statement:
¬(p ∧ q) = ¬p ∨ ¬q
¬(p ∨ q) = ¬p ∧ ¬q
Use: Push negations inside big expressions.
Example:
¬((p ∨ r) ∧ q) = ¬(p ∨ r) ∨ ¬q = (¬p ∧ ¬r) ∨ ¬q
Application: Used to get negations only on literals.
8 Tautology / Contradiction / Contingency
Statements:
• Tautology: True in all interpretations, e.g. p ∨ ¬p
• Contradiction: False in all interpretations, e.g. p ∧ ¬p
• Contingency: True in some, false in others
Use: Test by reduction or finding an interpretation.
9 Resolution Technique
Statement: Combine clauses containing a variable and its negation; eliminate that
variable.
Example:
(p ∨ q), (¬p ∨ r)
Resolving on p: q ∨ r
Application: Step-by-step refutation to prove logical consequence.
10 Implication Equivalence
Statement:
p → q ≡ ¬p ∨ q
Use: Rewrite implications for easier simplification.
3
11 Real-World Scenario Example
Problem: ”If I copy on the exam and the teacher catches me, then I fail.”
Formalization:
p = I copy, q = Teacher catches me, r = I fail
(p ∧ q) → r
Rewrite: ¬(p ∧ q) ∨ r ≡ ¬p ∨ ¬q ∨ r
Application: If you also have ¬r (I didn’t fail), from ¬p ∨ ¬q, means either I didn’t
copy or I wasn’t caught.
12 Critical Simplification Chain
Example:
(p ∨ q) ∨ (¬p ∨ r) = (p ∨ ¬p) ∨ (q ∨ r) = 1 ∨ (q ∨ r) = 1
Application: Quickly spot tautologies with regrouping.
13 Detecting Contingency
Example:
(p ∨ q) ∧ (¬p ∨ q) = q ∨ (p ∧ ¬p)
=q∨0=q
Thus, it’s a contingency since q decides the formula’s truth value.
14 Spotting Redundant Parts
Example:
(q ∨ r) ∧ (q ∨ ¬r) = q ∨ (r ∧ ¬r) = q ∨ 0 = q
Application: Two cases, but only q determines result.
15 Logical Consequence Interpretation
• If A implies B, A → B is a tautology.
• If you can make B true and A false in some interpretation, A is not a consequence
of B.
Exam Hack: When asked ”Does A follow from B?”, try to assign truth values that
make B true and A false. If impossible, then A is a logical consequence.
4
Final Advice
1. Use these tricks to quickly collapse, simplify, or classify logical expressions.
2. Practise translating verbal statements into logic, simplify and reason using the steps
above.
3. Review your teacher’s past problems and mimic their step-by-step justification style
for full marks.