TalentJR apps
Textbook: Mathematics I – Class 12 (Balbharati, official free PDF) · pages 8–13
Once you know the five basic tables, any statement pattern can be tested mechanically. This exercise asks you to build complete truth tables, to prove two patterns equivalent by showing their final columns match, and to label a pattern as a tautology (always true), a contradiction (always false) or a contingency (sometimes true, sometimes false). The method never changes: list every combination of T and F for the letters, add one column for each sub-expression, and finish with the column for the whole pattern. Below, every part of the exercise is worked column by column.
A statement pattern is built from letters p, q, r and connectives; its truth table lists its value for every combination of the letters.
With n letters there are 2ⁿ rows: 4 rows for two letters, 8 rows for three.
Two patterns are logically equivalent (≡) when their final columns are identical row by row.
A tautology is T in every row, a contradiction is F in every row, and a contingency has both T and F.
Useful facts proved here: p → q ≡ ~p ∨ q, ~(p ↔ q) ≡ (p ∧ ~q) ∨ (q ∧ ~p), and ∧ distributes over ∨.
Get a ✓ Verified tutor for “Exercise 1.2 – Truth tables, logical equivalence, tautology and contradiction” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Construct the truth table of (p ∨ q) → ~p.
Answer: Final column F F T T
Check whether p → q ≡ q → p.
Answer: Not equivalent: an implication and its converse are different
Classify (p ∧ q) → p.
Answer: Tautology
Find the rows where (p ∧ r) → q is false.
Answer: Only the row p = T, q = F, r = T
| What | Formula | Symbols |
|---|---|---|
| Rows | 2ⁿ rows for n letters | 3 letters → 8 rows |
| Equivalence | A ≡ B ⇔ identical final columns | p → q ≡ ~p ∨ q |
| Tautology | Final column all T | p ∨ ~p |
| Contradiction | Final column all F | p ∧ ~p |
| Contingency | Both T and F appear | p → q |
| Biconditional split | p ↔ q ≡ (p → q) ∧ (q → p) | Used in Q1 (vi) |
| Negated biconditional | ~(p ↔ q) ≡ (p ∧ ~q) ∨ (q ∧ ~p) | Q2 (ix) |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1 (i). Construct the truth table of [(p → q) ∧ q] → p.
Answer: Final column T T F T
2. Q1 (ii). Construct the truth table of (p ∧ ~q) ↔ (p → q).
Answer: Final column F F F F
3. Q1 (iii). Construct the truth table of (p ∧ q) ↔ (q ∨ r).
Answer: Final column T T F T F F F T
4. Q1 (iv). Construct the truth table of p → [~(q ∧ r)].
Answer: Final column F T T T T T T T
5. Q1 (v). Construct the truth table of ~p ∧ [(p ∨ ~q) ∧ q].
Answer: Final column F F F F
6. Q1 (vi). Construct the truth table of (~p → ~q) ∧ (~q → ~p).
Answer: Final column T F F T (same as p ↔ q)
7. Q1 (vii). Construct the truth table of (q → p) ∨ (~p ↔ q).
Answer: Final column T T T T
8. Q1 (viii). Construct the truth table of [p → (q → r)] ↔ [(p ∧ q) → r].
Answer: Final column T T T T T T T T
9. Q1 (ix). Construct the truth table of p → [~(q ∧ r)] (the same pattern as part iv).
Answer: Final column F T T T T T T T
10. Q1 (x). Construct the truth table of (p ∨ ~q) → (r ∧ p).
Answer: Final column T F T F T T F F
11. Q2 (i). Prove ~p ∧ q ≡ (p ∨ q) ∧ ~p by a truth table.
Answer: ~p ∧ q ≡ (p ∨ q) ∧ ~p (identical columns)
12. Q2 (ii). Prove ~(p ∨ q) ∨ (~p ∧ q) ≡ ~p by a truth table.
Answer: ~(p ∨ q) ∨ (~p ∧ q) ≡ ~p (identical columns)
13. Q2 (iii). Prove p ↔ q ≡ ~[(p ∨ q) ∧ ~(p ∧ q)] by a truth table.
Answer: p ↔ q ≡ ~[(p ∨ q) ∧ ~(p ∧ q)] (identical columns)
14. Q2 (iv). Prove p → (q → p) ≡ ~p → (p → q) by a truth table.
Answer: p → (q → p) ≡ ~p → (p → q) (identical columns)
15. Q2 (v). Prove (p ∨ q) → r ≡ (p → r) ∧ (q → r) by a truth table.
Answer: (p ∨ q) → r ≡ (p → r) ∧ (q → r) (identical columns)
16. Q2 (vi). Prove p → (q ∧ r) ≡ (p → q) ∧ (p → r) by a truth table.
Answer: p → (q ∧ r) ≡ (p → q) ∧ (p → r) (identical columns)
17. Q2 (vii). Prove p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) by a truth table.
Answer: p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) (identical columns)
18. Q2 (viii). Prove [~(p ∨ q) ∨ (p ∨ q)] ∧ r ≡ r by a truth table.
Answer: [~(p ∨ q) ∨ (p ∨ q)] ∧ r ≡ r (identical columns)
19. Q2 (ix). Prove ~(p ↔ q) ≡ (p ∧ ~q) ∨ (q ∧ ~p) by a truth table.
Answer: ~(p ↔ q) ≡ (p ∧ ~q) ∨ (q ∧ ~p) (identical columns)
20. Q3 (i). Is (p ∧ q) → (q ∨ p) a tautology, a contradiction or a contingency?
Answer: Tautology (all T)
21. Q3 (ii). Is (p → q) ↔ (~p ∨ q) a tautology, a contradiction or a contingency?
Answer: Tautology (all T)
22. Q3 (iii). Is [~(~p ∧ ~q)] ∨ q a tautology, a contradiction or a contingency?
Answer: Contingency (T T T F)
23. Q3 (iv). Is [(p → q) ∧ q] → p a tautology, a contradiction or a contingency?
Answer: Contingency (T T F T)
24. Q3 (v). Is [(p → q) ∧ ~q] → ~p a tautology, a contradiction or a contingency?
Answer: Tautology (all T)
25. Q3 (vi). Is (p ↔ q) ∧ (p → ~q) a tautology, a contradiction or a contingency?
Answer: Contingency (F F F T)
26. Q3 (vii). Is ~(~q ∧ p) ∧ q a tautology, a contradiction or a contingency?
Answer: Contingency (T F T F)
27. Q3 (viii). Is (p ∧ ~q) ↔ (p → q) a tautology, a contradiction or a contingency?
Answer: Contradiction (all F)
28. Q3 (ix). Is (~p → q) ∧ (p ∧ r) a tautology, a contradiction or a contingency?
Answer: Contingency (T F T F F F F F)
29. Q3 (x). Is [p → (~q ∨ r)] ↔ ~[p → (q → r)] a tautology, a contradiction or a contingency?
Answer: Contradiction (all F)
Read the question, answer it in your head, then tap the card to check. 20 cards.
15 questions. Tap an option — you will see at once if it is right and why.
1. p ∨ ~p is a
Answer: D. One of p, ~p is always true.
2. p ∧ ~p is a
Answer: B. Both cannot be true together.
3. p → q is logically equivalent to
Answer: D. Both are F only when p = T, q = F.
4. A truth table with p, q, r has
Answer: D. 2³ = 8.
5. (p ∧ q) → p is a
Answer: D. When p ∧ q is T, p is T.
6. (p ∧ ~q) ↔ (p → q) is a
Answer: D. Left side is the negation of the right side.
7. ~(p ↔ q) ≡
Answer: A. The two have different values in exactly the mixed rows.
8. Final column of p → q in the order TT, TF, FT, FF is
Answer: D. Only TF gives F.
9. Two patterns are equivalent if
Answer: C. Definition of ≡.
10. [(p → q) ∧ ~q] → ~p is a
Answer: C. Modus tollens is always valid.
11. (p ∨ q) → r ≡
Answer: D. Proved in Q2 (v).
12. In a 3-letter table the q column is
Answer: B. q changes every two rows.
13. (~p → ~q) ∧ (~q → ~p) has the same table as
Answer: B. Column T F F T.
14. Which is a contingency?
Answer: B. p → q has both T and F.
15. A ≡ B holds exactly when A ↔ B is a
Answer: D. Equal columns make the biconditional T in every row.
Get a ✓ Verified tutor for “Exercise 1.2 – Truth tables, logical equivalence, tautology and contradiction” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Exercise 1.2 – Truth tables, logical equivalence, tautology and contradiction the fun way: match key terms, beat the 60-second lightning round and spot true or false facts. Every game uses only this lesson, so each round is real exam revision.
⭐ 0 XP⏱ About 70 minutes
Get a ✓ Verified tutor for “Exercise 1.2 – Truth tables, logical equivalence, tautology and contradiction” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Sign in free to see the answers to the textbook exercise of Exercise 1.2 – Truth tables, logical equivalence, tautology and contradiction.
Sign in to see solutionsStuck on a question? Type it, 🎤 speak it or 📷 snap a photo of it and get simple, step-by-step help with “Mathematical Logic Ex 1.2” — important questions, a quick quiz, revision notes — in English, मराठी or हिंदी.
Sign in with Google to ask the AI tutor. It's free — 20 questions a day, one TalentJR account.
Sign in to askPrefer a real teacher? TalentJR teachers take live online classes anywhere in India. Tell us what you need and our team will call you with timings and fees.