Exercise 1.2 – Truth tables, logical equivalence, tautology and contradictionClass 12 Mathematics I · Chapter 1 Mathematical Logic · Exercise 1.2 – Maharashtra Board

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.

🎧 Listen to the summary

Summary: Exercise 1.2 – Truth tables, logical equivalence, tautology and contradiction

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 ∨.

Key points to remember

  • Write the rows in a fixed order (TT, TF, FT, FF or TTT … FFF) so you never miss a combination.
  • For three letters, the p-column is 4 T then 4 F, the q-column alternates in pairs, and the r-column alternates singly.
  • Make one column per sub-expression, working from the innermost bracket outwards.
  • To prove A ≡ B, show the final column of A equals the final column of B; equal columns anywhere else prove nothing.
  • A ≡ B holds exactly when A ↔ B is a tautology.
  • p ∨ ~p is the simplest tautology (t), p ∧ ~p the simplest contradiction (c).
  • Any pattern of the form X ↔ ~X is a contradiction; X → X and X ∨ ~X are tautologies.
  • [(p → q) ∧ ~q] → ~p is a tautology (modus tollens), but [(p → q) ∧ q] → p is not: assuming the converse is a classic error.
  • Priority when brackets are missing: ~, then ∧ and ∨, then →, then ↔.
Want a teacher to explain Exercise 1.2 – Truth tables, logical equivalence, tautology and contradiction?

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.

Get a tutor for this chapter →

👩‍🏫 Class 12 Maths classes — live online, request a call back

Prefer 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.

Live online classesSmall groups or 1:1 with a teacher, from home, any city.
We call you backOur team asks what your child needs, then shares timings and fees.
Home tutor?We are still building our list of home tutors — ask on the call if there is one near you.

Keep learning