TalentJR apps
Textbook: Mathematics and Statistics (Commerce) Part I – Class 12 (Balbharati, official free PDF) · pages 21–22
Once the basic laws of logic are known, you can prove that two patterns are equivalent by rewriting one into the other, just as you simplify algebraic expressions. This saves drawing big truth tables. The tools are the idempotent, associative, commutative, distributive, identity, complement, involution and De Morgan laws, plus two conversion rules: p → q ≡ ∼p ∨ q and p ↔ q ≡ (p → q) ∧ (q → p). Every proof below names the law used in each line, and each result was double-checked with a computer truth table.
The laws of logic let us replace a pattern by an equivalent one step by step.
Convert → and ↔ into ∧, ∨, ∼ first: p → q ≡ ∼p ∨ q.
Use De Morgan to push ∼ inside brackets, and involution to cancel ∼∼.
Use distributive laws to expand or factorise, then complement (p ∨ ∼p ≡ t, p ∧ ∼p ≡ c) and identity laws (p ∧ t ≡ p, p ∨ c ≡ p) to tidy up.
One of the book's claims, (p ∨ q) ∧ (∼p ∨ ∼q) ≡ (p ∨ ∼q) ∧ (∼p ∨ q), is false; the left side is actually the negation of the right side.
Get a ✓ Verified tutor for “Exercise 1.9 – Algebra of statements: proving equivalences without truth tables” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Simplify q ∨ (∼q ∧ p).
Answer: p ∨ q
Show (p ∧ q) → p is a tautology algebraically.
Answer: Tautology
Prove (p ∧ ∼q) ∨ (p ∧ q) ≡ p.
Answer: p
Is p → q ≡ q → p?
Answer: No, they are not equivalent
| What | Formula | Symbols |
|---|---|---|
| Distributive | p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) | and its dual |
| Identity | p ∧ t ≡ p, p ∨ c ≡ p | p ∨ t ≡ t, p ∧ c ≡ c |
| Complement | p ∨ ∼p ≡ t, p ∧ ∼p ≡ c | ∼t ≡ c |
| Conditional | p → q ≡ ∼p ∨ q | ∼(p → q) ≡ p ∧ ∼q |
| Biconditional | p ↔ q ≡ (p ∧ q) ∨ (∼p ∧ ∼q) | proved in Q1 (i) |
| De Morgan | ∼(p ∨ q) ≡ ∼p ∧ ∼q | ∼(p ∧ q) ≡ ∼p ∨ ∼q |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1 (i). Show p ↔ q ≡ (p ∧ q) ∨ (∼p ∧ ∼q).
Answer: (p ∧ q) ∨ (∼p ∧ ∼q) — proved
2. Q1 (ii). Show p ∧ [(∼p ∨ q) ∨ ∼q] ≡ p.
Answer: p — proved
3. Q1 (iii). Show ∼[(p ∧ q) → ∼q] ≡ p ∧ q.
Answer: p ∧ q — proved
4. Q1 (iv). Show ∼r → ∼(p ∧ q) ≡ [∼(q → r)] → ∼p.
Answer: Both sides ≡ ∼p ∨ ∼q ∨ r — proved
5. Q1 (v). Show (p ∨ q) → r ≡ (p → r) ∧ (q → r).
Answer: Proved
6. Q2 (i). Prove [p ∧ (q ∨ r)] ∨ [∼r ∧ ∼q ∧ p] ≡ p.
Answer: p — proved
7. Q2 (ii). Prove (p ∧ q) ∨ (p ∧ ∼q) ∨ (∼p ∧ ∼q) ≡ p ∨ ∼q.
Answer: p ∨ ∼q — proved
8. Q2 (iii). Prove (p ∨ q) ∧ (∼p ∨ ∼q) ≡ (p ∨ ∼q) ∧ (∼p ∨ q).
Answer: Not equivalent as printed; (p ∨ q) ∧ (∼p ∨ ∼q) ≡ (p ∧ ∼q) ∨ (∼p ∧ q), the negation of the right side
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 ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) is the
Answer: A. ∧ spreads over ∨.
2. p ∨ c ≡
Answer: D. Identity law.
3. p ∧ ∼p ≡
Answer: A. Complement law.
4. p ∨ (∼p ∧ q) ≡
Answer: A. Distribute, then complement and identity.
5. ∼(p ∧ q) → r is equivalent to
Answer: D. A → B ≡ ∼A ∨ B with A = ∼(p ∧ q).
6. p ∧ [(∼p ∨ q) ∨ ∼q] simplifies to
Answer: B. Inner part is t.
7. (p ∨ q) → r ≡
Answer: D. Proved in Q1 (v).
8. p ↔ q ≡
Answer: C. Both true or both false.
9. t ∨ q ≡
Answer: D. Identity law.
10. ∼[(p ∧ q) → ∼q] ≡
Answer: C. ∼(A → B) ≡ A ∧ ∼B.
11. Which law gives ∼(∼p) ≡ p?
Answer: B. Double negation.
12. For p = T, q = T, (p ∨ q) ∧ (∼p ∨ ∼q) is
Answer: C. T ∧ F.
13. (p ∧ q) ∨ (p ∧ ∼q) ≡
Answer: D. Factor p, then complement.
14. p → q ≡ ∼q → ∼p is the
Answer: B. Name of the law.
15. To prove an equivalence without a table, first
Answer: D. Then only ∧, ∨, ∼ remain.
Get a ✓ Verified tutor for “Exercise 1.9 – Algebra of statements: proving equivalences without truth tables” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Exercise 1.9 – Algebra of statements: proving equivalences without truth tables 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 45 minutes
Get a ✓ Verified tutor for “Exercise 1.9 – Algebra of statements: proving equivalences without truth tables” — 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.9 – Algebra of statements: proving equivalences without truth tables.
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.9” — 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.