Summary
A statement pattern (compound statement form) is built from statement letters p, q, r and connectives, for example (p ∧ q) → ~r. A truth table lists the truth value of the pattern for every combination of values of its letters. With n letters there are 2ⁿ rows: 4 for two letters and 8 for three.
Build the table column by column: first the letters, then the smallest brackets, then the next bracket outwards, and the whole pattern in the last column. Deal with ~ first, then ∧ and ∨, then → and ↔. Most MHT-CET questions do not need the full table. They either give the values of the letters (just substitute), or give the value of the whole…
Key formulas
- Rows in a truth table
- 2ⁿ for n letters
- Tautology t
- T in every row; ~t = c
- Contradiction c
- F in every row; ~c = t
- Contingency
- T in some rows, F in others
- p ≡ q
- p ↔ q is a tautology
- p → q
- ≡ ~p ∨ q ≡ ~q → ~p
- p ↔ q
- ≡ (p → q) ∧ (q → p)
- ~(p ↔ q)
- ≡ p ↔ ~q ≡ (p ∧ ~q) ∨ (~p ∧ q)
What this note covers
- Truth tables of statement patterns
- Tautology, contradiction and contingency
- Logical equivalence
Solved past-paper question (MHT-CET 2026)
If the statement (p\wedge q)→(r\vee\neg s) is False, find the truth values of p,q,r, and s.
- (A) p=T,q=T,r=F,s=T
- (B) p=F,q=T,r=F,s=T
- (C) p=T,q=F,r=T,s=F
- (D) p=F,q=F,r=T,s=T
Solution
A conditional is false only when the antecedent is T and the consequent is F.
Antecedent p ∧ q is true, so both p and q are true.
p = T, q = T
Consequent r ∨ ~s is false, so r is false and ~s is false.
r = F, ~s = F
If ~s is false then s is true.
s = T
So p, q, r, s are T, T, F, T.
(T, T, F, T)
Answer: (A) p=T,q=T,r=F,s=T
Common mistake: Looking for any one false row. A conditional is false in exactly one case, so every letter is fixed.
The full note has 8 solved questions, 8 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.