Summary
Statement patterns obey a set of laws, just like numbers do in algebra. Here t is a tautology and c is a contradiction. Each law is an equivalence, which you can check with a truth table. Learn them as pairs: the ∧ form and the ∨ form are duals of each other.
Other laws: involution ~(~p) ≡ p, ~t ≡ c, ~c ≡ t, and the conditional law p → q ≡ ~p ∨ q. The second distributive law (∨ over ∧) has no twin in number algebra, so it is a common trap.
Key formulas
- Identity
- p ∧ t ≡ p; p ∨ c ≡ p
- Domination
- p ∨ t ≡ t; p ∧ c ≡ c
- Complement
- p ∨ ~p ≡ t; p ∧ ~p ≡ c; ~t ≡ c; ~c ≡ t
- Absorption
- p ∨ (p ∧ q) ≡ p; p ∧ (p ∨ q) ≡ p
- Distributive
- p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r); p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
- Useful reductions
- p ∨ (~p ∧ q) ≡ p ∨ q; p ∧ (~p ∨ q) ≡ p ∧ q
- Conditional
- p → q ≡ ~p ∨ q
What this note covers
- Laws of algebra of statements
- Simplification of statement patterns
Solved past-paper question (MHT-CET 2024)
The statement pattern [p\wedge(q\vee r)]\vee[\sim r\wedge\sim q\wedge p] is equivalent to
- (A) q\vee r
- (B) p\vee r
- (C) q
- (D) p
Solution
Write ~r ∧ ~q ∧ p as p ∧ ~(q ∨ r), by De Morgan.
~r ∧ ~q ≡ ~(q ∨ r)
Now both brackets have p and a bracket (q ∨ r) or its negation. Factor out p.
p ∧ [(q ∨ r) ∨ ~(q ∨ r)]
The bracket has the form x ∨ ~x, which is a tautology t.
≡ p ∧ t
By the identity law p ∧ t ≡ p. The answer is p.
≡ p
Answer: (D) p
Common mistake: Expanding everything. Spot that ~r ∧ ~q is ~(q ∨ r) and the pair collapses.
The full note has 6 solved questions, 6 practice questions, figures and a topic test. Reading it on PrepKi is free after you log in.
PDF download is included in PrepKi plans. See plans.