TalentJR apps
Textbook: Mathematics I – Class 12 (Balbharati, official free PDF) · pages 18–21
Truth tables always work, but they grow quickly. The algebra of statements lets you simplify and prove results in a few lines, exactly like simplifying an algebraic expression, using laws such as De Morgan, distributive, complement, identity and absorption. In this exercise you negate patterns step by step, rewrite 'if…then' sentences using only 'or', and prove equivalences without a table. These same laws are what you will use to simplify switching circuits in the next exercise.
Each law of the algebra of statements is an equivalence that can be used to replace one pattern with another.
The conditional law p → q ≡ ~p ∨ q lets you write any 'if…then' sentence with 'or' and 'not'.
Negations are pushed inside step by step using De Morgan and ~(p → q) ≡ p ∧ ~q, naming the law at each step.
Complement, identity and absorption laws remove terms: p ∧ ~p ≡ c, p ∨ c ≡ p, p ∨ (p ∧ q) ≡ p.
A proof without a truth table is a chain of equivalences from the left side to the right side, with a law named on each line.
Get a ✓ Verified tutor for “Exercise 1.4 – Algebra of statements: negations, rewriting conditionals, proofs without tables” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Simplify (p ∧ q) ∨ (p ∧ ~q).
Answer: p
Negate (~p ∨ q) → r with reasons.
Answer: (~p ∨ q) ∧ ~r
Rewrite without 'if…then': 'If a number ends in 0, it is divisible by 5.'
Answer: A number does not end in 0 or it is divisible by 5.
Prove p ∨ (~p ∧ q) ≡ p ∨ q.
Answer: Proved
| What | Formula | Symbols |
|---|---|---|
| Distributive | p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r); p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) | |
| De Morgan | ~(p ∧ q) ≡ ~p ∨ ~q; ~(p ∨ q) ≡ ~p ∧ ~q | |
| Identity | p ∧ t ≡ p, p ∨ c ≡ p, p ∧ c ≡ c, p ∨ t ≡ t | |
| Complement | p ∨ ~p ≡ t, p ∧ ~p ≡ c | |
| Absorption | p ∨ (p ∧ q) ≡ p, p ∧ (p ∨ q) ≡ p | |
| Conditional | p → q ≡ ~p ∨ q; ~(p → q) ≡ p ∧ ~q | |
| Biconditional | p ↔ q ≡ (~p ∨ q) ∧ (~q ∨ p) |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1 (i)–(iv). Negate with reasons: (i) ~q → p (ii) p ∧ ~q (iii) p ∨ ~q (iv) (p ∨ ~q) ∧ r.
Answer: (i) ~q ∧ ~p (ii) ~p ∨ q (iii) ~p ∧ q (iv) (~p ∧ q) ∨ ~r
2. Q1 (v)–(viii). Negate with reasons: (v) p → (p ∨ ~q) (vi) ~(p ∧ q) ∨ (p ∨ ~q) (vii) (p ∨ ~q) → (p ∧ ~q) (viii) (~p ∨ ~q) ∨ (p ∧ ~q).
Answer: (v) p ∧ (~p ∧ q) (vi) (p ∧ q) ∧ (~p ∧ q) (vii) (p ∨ ~q) ∧ (~p ∨ q) (viii) (p ∧ q) ∧ (~p ∨ q)
3. Q2. Rewrite without 'if…then': (i) if a man is a judge then he is honest (ii) if √2 is rational then √2 is irrational (iii) if f(2) = 0 then f(x) is divisible by (x − 2).
Answer: (i) A man is not a judge or he is honest. (ii) √2 is not rational or √2 is irrational. (iii) f(2) ≠ 0 or f(x) is divisible by (x − 2).
4. Q3 (i). Prove without a truth table: p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q).
Answer: Proved
5. Q3 (ii). Prove (p ∨ q) ∧ (p ∨ ~q) ≡ p.
Answer: Proved
6. Q3 (iii). Prove (p ∧ q) ∨ (~p ∧ q) ∨ (p ∧ ~q) ≡ p ∨ q.
Answer: Proved
7. Q3 (iv). Prove ~[(p ∨ ~q) → (p ∧ ~q)] ≡ (p ∨ ~q) ∧ (~p ∨ q).
Answer: Proved
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 ≡
Answer: B. Conditional law.
2. ~(p ∧ ~q) ≡
Answer: A. De Morgan and double negation.
3. (p ∨ q) ∧ (p ∨ ~q) ≡
Answer: B. p ∨ (q ∧ ~q) ≡ p ∨ c ≡ p.
4. p ∨ (p ∧ q) ≡
Answer: D. Absorption.
5. p ∧ c ≡
Answer: C. Identity law.
6. The negation of ~q → p is
Answer: A. ~(a → b) ≡ a ∧ ~b.
7. 'If x = 3 then x² = 9' without 'if…then' is
Answer: A. ~p ∨ q.
8. (p ∧ q) ∨ (~p ∧ q) ≡
Answer: A. (p ∨ ~p) ∧ q ≡ q.
9. p ∨ ~p ≡
Answer: A. Complement law.
10. ~[(p ∨ ~q) ∧ r] ≡
Answer: B. De Morgan twice.
11. p ↔ q ≡
Answer: C. True when both T or both F.
12. The negation of p → (p ∨ ~q) is
Answer: B. p ∧ ~(p ∨ ~q) then De Morgan.
13. p ∨ (~p ∧ q) ≡
Answer: D. Distribute then use complement and identity.
14. Which law gives p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)?
Answer: B. ∧ distributes over ∨.
15. ~(p ∨ q) ∨ (~p ∧ q) ≡
Answer: D. (~p ∧ ~q) ∨ (~p ∧ q) ≡ ~p ∧ t.
Get a ✓ Verified tutor for “Exercise 1.4 – Algebra of statements: negations, rewriting conditionals, proofs without tables” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Exercise 1.4 – Algebra of statements: negations, rewriting conditionals, proofs without 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 40 minutes
Get a ✓ Verified tutor for “Exercise 1.4 – Algebra of statements: negations, rewriting conditionals, proofs without 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.4 – Algebra of statements: negations, rewriting conditionals, proofs without 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.4” — 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.