TalentJR apps
Textbook: Logic – Class 11 (Balbharati, official free PDF) · pages 46–63
A truth table can test any argument, but with many letters it grows huge. The method of deduction proves validity step by step, like a chain where every link is a rule. Learn what deductive (direct) proof is, the nine rules of inference (M.P., M.T., H.S., D.S., C.D., D.D., Simp., Conj., Add.), the ten rules of replacement (De M., Com., Assoc., Dist., D.N., Trans., Impl., Equiv., Exp., Taut.), and see all 60 proofs from Q.10 and Q.11 written out with the rule at every step.
Logicians use two kinds of method: decision procedures (like the truth table) and methods that are not decision procedures. Deductive proof belongs to the second kind: it is reliable and finite but not mechanical, because choosing which rule to apply needs intelligence. It proves that a valid argument is valid (or that a form is a tautology); it cannot show that an argument is invalid.
Deductive proof has three types — direct, conditional and indirect. Direct proof derives the conclusion straight from the premises through a chain of elementary valid arguments, without making any assumption. Conditional and indirect proof can also prove tautologies.
A formal proof is written by numbering the premises, writing the conclusion after a slash on the last premise line, and then adding new numbered lines, each with its justification on the right: the line numbers used and the rule applied. Use one rule per line. When the conclusion appears, the proof is complete.
The first nine rules are rules of inference — elementary valid argument forms: Modus Ponens, Modus Tollens, Hypothetical Syllogism, Disjunctive Syllogism, Constructive Dilemma, Destructive Dilemma, Simplification, Conjunction and Addition. They apply only to whole lines.
Because the nine rules are not enough (for example to get D from A • D), the rule of replacement (principle of extensionality) is added: any expression may be replaced by a logically equivalent one. It gives ten more rules — De Morgan, Commutation, Association, Distribution, Double Negation, Transposition, Material Implication, Material Equivalence, Exportation and Tautology — which work both ways and may be used on part of a line.
Get a ✓ Verified tutor for “The Method of Deduction” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Prove: 1. A ⊃ B 2. B ⊃ C 3. ~C / ∴ ~A ∨ D
Answer: Proof complete in three steps: H.S., M.T., Add.
Prove: 1. ~(A ∨ B) 2. C ⊃ A / ∴ ~C • ~B
Answer: Note line 6: Simp. only gives the first conjunct, so Com. is used before taking ~B.
| Rule (abbreviation) | Form | Based on / remember |
|---|---|---|
| Modus Ponens (M.P.) | p ⊃ q, p ∴ q | Conditional; affirm antecedent |
| Modus Tollens (M.T.) | p ⊃ q, ~q ∴ ~p | Conditional; deny consequent |
| Hypothetical Syllogism (H.S.) | p ⊃ q, q ⊃ r ∴ p ⊃ r | Chain of conditionals |
| Disjunctive Syllogism (D.S.) | p ∨ q, ~p ∴ q | Disjunction; deny first disjunct |
| Constructive Dilemma (C.D.) | (p ⊃ q) • (r ⊃ s), p ∨ r ∴ q ∨ s | Affirm antecedents |
| Destructive Dilemma (D.D.) | (p ⊃ q) • (r ⊃ s), ~q ∨ ~s ∴ ~p ∨ ~r | Deny consequents |
| Simplification (Simp.) | p • q ∴ p | First conjunct only |
| Conjunction (Conj.) | p, q ∴ p • q | Join two lines |
| Addition (Add.) | p ∴ p ∨ q | Any second disjunct |
| De Morgan (De M.) | ~(p • q) ≡ (~p ∨ ~q); ~(p ∨ q) ≡ (~p • ~q) | Change • ↔ ∨, move ~ inside |
| Commutation (Com.) | (p • q) ≡ (q • p); (p ∨ q) ≡ (q ∨ p) | Swap order |
| Association (Assoc.) | [p • (q • r)] ≡ [(p • q) • r]; same for ∨ | Regroup, same connective |
| Distribution (Dist.) | [p • (q ∨ r)] ≡ [(p • q) ∨ (p • r)]; [p ∨ (q • r)] ≡ [(p ∨ q) • (p ∨ r)] | Spread over the bracket |
| Double Negation (D.N.) | p ≡ ~~p | Two ~ cancel |
| Transposition (Trans.) | (p ⊃ q) ≡ (~q ⊃ ~p) | Swap and negate both |
| Material Implication (Impl.) | (p ⊃ q) ≡ (~p ∨ q) | ⊃ to ∨ with ~ on the left |
| Material Equivalence (Equiv.) | (p ≡ q) ≡ [(p ⊃ q) • (q ⊃ p)]; (p ≡ q) ≡ [(p • q) ∨ (~p • ~q)] | Two-way implication |
| Exportation (Exp.) | [(p • q) ⊃ r] ≡ [p ⊃ (q ⊃ r)] | Three components |
| Tautology (Taut.) | p ≡ (p • p); p ≡ (p ∨ p) | Collapse repeats |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q.1 Fill in the blanks (10) and Q.2 True or false (10).
Answer: Q.1: 1 ~S ∨ ~~R. 2 Commutation. 3 Conjunctive. 4 ~B ∨ ~R. 5 Tautology. 6 Association. 7 ~T ⊃ ~K. 8 Conditional. 9 Exportation. 10 Whole as well as part. Q.2: 1 False — only to whole lines. 2 False — not mechanical. 3 False — D.S. is a rule of inference. 4 True. 5 False — that is Addition. 6 True — it expresses M.P. as a conditional. 7 True. 8 False — it needs intelligence. 9 False — H.S. rests on conditional statements. 10 False — that is Conjunction.
2. Q.3 Match (p; p ⊃ q; p ≡ q; ~(p • q); p ∨ (q • r)), Q.4 Reasons and Q.5/Q.6 Explain or distinguish.
Answer: Q.3: p — ~~p; p ⊃ q — ~p ∨ q; p ≡ q — (p ⊃ q) • (q ⊃ p); ~(p • q) — ~p ∨ ~q; p ∨ (q • r) — (p ∨ q) • (p ∨ r). Q.4: (1) It is reliable and finite but not mechanical; a decision procedure must satisfy all three. (2) They are argument forms: what holds of a whole statement need not hold of a part (from (A • B) ⊃ C we cannot Simp. out A). (3) They are logical equivalences; swapping an equivalent part never changes the truth value of the whole. Q.5/Q.6: give each rule's form, what it is based on and an example (see the table). M.P. affirms the antecedent, M.T. denies the consequent; H.S. needs two conditionals, D.S. a disjunction and a denial; Simp. breaks a conjunction, Conj. builds one; Com. just reorders, Trans. reorders a conditional and negates both parts; inference rules are one-way and whole-line, replacement rules two-way and part-line.
3. Q.7 Valid or invalid? (1) (A ⊃ B) ⊃ ~C, A ⊃ B ∴ C (2) (M • N) ∨ (T ≡ S), M • N ∴ T ≡ S (3) L ⊃ (K ∨ L), ~L ∴ K ∨ L (4) ~R ⊃ (T • W), ~(T • W) ∴ R (5) (S ⊃ ~T) • (R ⊃ W), S ∨ R ∴ ~T ∨ W (6) (H ⊃ L) • (K ⊃ J), ~L ∨ ~J ∴ ~H ∨ ~K (7) (R ≡ S) • (M ⊃ N), R ∨ M ∴ S ∨ N (8) (T ⊃ W) • L ∴ T ⊃ W (9) S ∨ ~L, ~T ⊃ W ∴ (S ∨ ~L) • (~T ⊃ W) (10) J ⊃ L, ~L ⊃ K ∴ J ⊃ K
Answer: (1) Invalid — M.P. gives ~C, not C. (2) Invalid — the first disjunct is affirmed; nothing follows about the second. (3) Invalid — denying the antecedent. (4) Valid — M.T. gives ~~R, then D.N. gives R. (5) Valid — C.D. (6) Valid — D.D. (7) Valid as an argument (truth table: no row has true premises and a false conclusion), but it is not a direct C.D., because R ≡ S is not a conditional; first get R ⊃ S by Equiv. and Simp. (8) Valid — Simp. (9) Valid — Conj. (10) Invalid — not H.S., since the consequent L of the first is not the antecedent ~L of the second (row J T, L T, K F).
4. Q.8 Correct or incorrect equivalences (10) and Q.9 Justify each step (10 proofs).
Answer: Q.8: 1 Correct (De M. with D.N.). 2 Correct (D.N.). 3 Incorrect — (~K ∨ ~K) ≡ ~K. 4 Incorrect — the right side should be R • (~S • ~T) (Assoc.). 5 Correct (Dist.). 6 Correct (Trans.). 7 Incorrect — ~S • ~T ≡ ~(S ∨ T). 8 Correct (Impl. with D.N.). 9 Incorrect — (p ≡ q) ≡ [(p • q) ∨ (~p • ~q)]. 10 Incorrect — Exp. is [(p • q) ⊃ r] ≡ [p ⊃ (q ⊃ r)]. Q.9: (1) 3: 1 Dist.; 4: 2 Impl. and D.N.; 5: 4 D.N.; 6: 4 De M.; 7: 3 Com.; 8: 7, 6 D.S. (2) 4: 2, 3 M.T.; 5: 4 De M.; 6: 1, 5 D.D.; 7: 6 Taut. (3) 3: 2 De M.; 4: 3 D.N.; 5: 1, 4 C.D.; 6: 5 Impl. (4) 3: 2 D.N.; 4: 1, 3 M.T.; 5: 4 De M.; 6: 5 Com.; 7: 6 Simp. (5) 4: 1, 3 M.T.; 5: 4 D.N.; 6: 5 Add.; 7: 2, 6 M.P.; 8: 7 Simp.; 9: 8 Add. (or Taut.). (6) 4: 1 Com.; 5: 4, 2 D.S.; 6: 3 Exp.; 7: 6, 5 M.P.; 8: 7 Impl. (7) 4: 1 Assoc.; 5: 4 Simp.; 6: 2, 5 M.P.; 7: 6, 3 D.S. (8) 5: 1, 3 D.S.; 6: 5, 4 Conj.; 7: 2, 6 M.P.; 8: 7 Simp.; 9: 8 Add.; 10: 9 Com.; 11: 10 Impl. (9) 4: 1 Impl.; 5: 4, 2 H.S.; 6: 5 Trans.; 7: 3, 6 M.P.; 8: 7 Add. (10) 4: 1, 2 Conj.; 5: 3 De M.; 6: 4, 5 D.D.
5. Q.10 (1–10) Formal proofs using the nine rules of inference.
Answer: (1) 1. P ⊃ Q 2. P ⊃ R 3. P / ∴ Q • R. Proof: 4. Q — 1, 3, M.P.; 5. R — 2, 3, M.P.; 6. Q • R — 4, 5, Conj. (2) 1. T ⊃ P 2. ~P 3. ~T ⊃ ~R / ∴ ~R ∨ S. Proof: 4. ~T — 1, 2, M.T.; 5. ~R — 3, 4, M.P.; 6. ~R ∨ S — 5, Add. (3) 1. M ⊃ N 2. N ⊃ O 3. (M ⊃ O) ⊃ (N • P) / ∴ N ∨ R. Proof: 4. M ⊃ O — 1, 2, H.S.; 5. N • P — 3, 4, M.P.; 6. N — 5, Simp.; 7. N ∨ R — 6, Add. (4) 1. A ∨ B 2. ~A 3. M • D / ∴ B • M. Proof: 4. B — 1, 2, D.S.; 5. M — 3, Simp.; 6. B • M — 4, 5, Conj. (5) 1. M ∨ ~S 2. ~M 3. P ⊃ S / ∴ ~P ∨ R. Proof: 4. ~S — 1, 2, D.S.; 5. ~P — 3, 4, M.T.; 6. ~P ∨ R — 5, Add. (6) 1. ~A 2. ~B 3. (~A • ~B) ⊃ R / ∴ R. Proof: 4. ~A • ~B — 1, 2, Conj.; 5. R — 3, 4, M.P. (7) 1. A • S 2. A ⊃ ~B 3. B ∨ T / ∴ T ∨ ~M. Proof: 4. A — 1, Simp.; 5. ~B — 2, 4, M.P.; 6. T — 3, 5, D.S.; 7. T ∨ ~M — 6, Add. (8) 1. W ∨ T 2. (W ∨ T) ⊃ (L • ~S) / ∴ L. Proof: 3. L • ~S — 2, 1, M.P.; 4. L — 3, Simp. (9) 1. (P ⊃ Q) • R 2. (Q ⊃ R) • S / ∴ P ⊃ R. Proof: 3. P ⊃ Q — 1, Simp.; 4. Q ⊃ R — 2, Simp.; 5. P ⊃ R — 3, 4, H.S. (10) 1. (A • B) ⊃ S 2. S ⊃ R 3. A 4. B / ∴ R. Proof: 5. A • B — 3, 4, Conj.; 6. S — 1, 5, M.P.; 7. R — 2, 6, M.P.
6. Q.10 (11–20) Formal proofs using the nine rules of inference.
Answer: (11) 1. (T ∨ S) ⊃ P 2. P ⊃ Q 3. T / ∴ Q. Proof: 4. T ∨ S — 3, Add.; 5. P — 1, 4, M.P.; 6. Q — 2, 5, M.P. (12) 1. Q ⊃ S 2. P ⊃ T 3. Q ∨ P 4. ~S / ∴ T. Proof: 5. (Q ⊃ S) • (P ⊃ T) — 1, 2, Conj.; 6. S ∨ T — 5, 3, C.D.; 7. T — 6, 4, D.S. (13) 1. (M ∨ O) ⊃ (A • M) 2. (A • M) ⊃ (D • E) 3. M / ∴ D. Proof: 4. M ∨ O — 3, Add.; 5. A • M — 1, 4, M.P.; 6. D • E — 2, 5, M.P.; 7. D — 6, Simp. (14) 1. P ⊃ T 2. T ⊃ ~D 3. ~D ⊃ M / ∴ P ⊃ M. Proof: 4. P ⊃ ~D — 1, 2, H.S.; 5. P ⊃ M — 4, 3, H.S. (15) 1. H ⊃ K 2. T ∨ F 3. H 4. ~T / ∴ F • K. Proof: 5. F — 2, 4, D.S.; 6. K — 1, 3, M.P.; 7. F • K — 5, 6, Conj. (16) 1. A ⊃ (B ∨ S) 2. ~(B ∨ S) 3. D ⊃ L 4. A ∨ D / ∴ L. Proof: 5. ~A — 1, 2, M.T.; 6. D — 4, 5, D.S.; 7. L — 3, 6, M.P. (17) 1. A ∨ B 2. B ⊃ M 3. A ⊃ D 4. ~D / ∴ B • (A ∨ B). Proof: 5. ~A — 3, 4, M.T.; 6. B — 1, 5, D.S.; 7. B • (A ∨ B) — 6, 1, Conj. (18) 1. A ⊃ B 2. ~A ⊃ ~C 3. C ∨ (D • E) 4. ~B / ∴ D ∨ (S ≡ ~R). Proof: 5. ~A — 1, 4, M.T.; 6. ~C — 2, 5, M.P.; 7. D • E — 3, 6, D.S.; 8. D — 7, Simp.; 9. D ∨ (S ≡ ~R) — 8, Add. (19) 1. ~S ⊃ (P ⊃ T) 2. ~(P ⊃ T) 3. A ⊃ M 4. ~S ∨ A / ∴ M ∨ (R • Q). Proof: 5. ~~S — 1, 2, M.T.; 6. A — 4, 5, D.S.; 7. M — 3, 6, M.P.; 8. M ∨ (R • Q) — 7, Add. (20) 1. ~S • (A ∨ B) 2. (M ⊃ S) • R 3. M ∨ ~T / ∴ ~T ∨ ~K. Proof: 4. ~S — 1, Simp.; 5. M ⊃ S — 2, Simp.; 6. ~M — 5, 4, M.T.; 7. ~T — 3, 6, D.S.; 8. ~T ∨ ~K — 7, Add.
7. Q.10 (21–30) Formal proofs using the nine rules of inference.
Answer: (21) 1. A ⊃ M 2. P ⊃ T 3. P ∨ A 4. ~T / ∴ M. Proof: 5. ~P — 2, 4, M.T.; 6. A — 3, 5, D.S.; 7. M — 1, 6, M.P. (22) 1. S ⊃ M 2. P ⊃ A 3. ~A ∨ ~M 4. K • S / ∴ (~P ∨ ~S) • K. Proof: 5. (P ⊃ A) • (S ⊃ M) — 2, 1, Conj.; 6. ~P ∨ ~S — 5, 3, D.D.; 7. K — 4, Simp.; 8. (~P ∨ ~S) • K — 6, 7, Conj. (23) 1. R ⊃ S 2. A ⊃ B 3. ~T 4. ~S ∨ ~B / ∴ (~R ∨ ~A) • ~T. Proof: 5. (R ⊃ S) • (A ⊃ B) — 1, 2, Conj.; 6. ~R ∨ ~A — 5, 4, D.D.; 7. (~R ∨ ~A) • ~T — 6, 3, Conj. (24) 1. A ⊃ (~B ∨ ~D) 2. D ⊃ A 3. D 4. A ⊃ B 5. M ⊃ D / ∴ ~A ∨ ~M. Proof: 6. A — 2, 3, M.P.; 7. ~B ∨ ~D — 1, 6, M.P.; 8. (A ⊃ B) • (M ⊃ D) — 4, 5, Conj.; 9. ~A ∨ ~M — 8, 7, D.D. (25) 1. R ⊃ T 2. S ⊃ B 3. R • M 4. ~T / ∴ B ∨ ~A. Proof: 5. R — 3, Simp.; 6. T — 1, 5, M.P.; 7. T ∨ (B ∨ ~A) — 6, Add.; 8. B ∨ ~A — 7, 4, D.S. (26) 1. R ∨ S 2. [(R ∨ S) ∨ K] ⊃ ~L 3. T / ∴ ~L • T. Proof: 4. (R ∨ S) ∨ K — 1, Add.; 5. ~L — 2, 4, M.P.; 6. ~L • T — 5, 3, Conj. (27) 1. ~K • ~S 2. M ∨ T 3. M ⊃ K / ∴ T ∨ (S ⊃ R). Proof: 4. ~K — 1, Simp.; 5. ~M — 3, 4, M.T.; 6. T — 2, 5, D.S.; 7. T ∨ (S ⊃ R) — 6, Add. (28) 1. ~A ⊃ R 2. S ⊃ ~A 3. ~R 4. S ∨ ~P / ∴ ~P. Proof: 5. ~~A — 1, 3, M.T.; 6. ~S — 2, 5, M.T.; 7. ~P — 4, 6, D.S. (29) 1. L ∨ ~S 2. ~A 3. (~A ∨ ~M) ⊃ ~L 4. P • B / ∴ ~S • (P • B). Proof: 5. ~A ∨ ~M — 2, Add.; 6. ~L — 3, 5, M.P.; 7. ~S — 1, 6, D.S.; 8. ~S • (P • B) — 7, 4, Conj. (30) 1. A ⊃ ~B 2. A • ~R 3. B ∨ (S ∨ ~M) 4. ~S • ~T / ∴ A • ~M. Proof: 5. A — 2, Simp.; 6. ~B — 1, 5, M.P.; 7. S ∨ ~M — 3, 6, D.S.; 8. ~S — 4, Simp.; 9. ~M — 7, 8, D.S.; 10. A • ~M — 5, 9, Conj.
8. Q.11 (1–10) Formal proofs using inference and replacement.
Answer: (1) 1. ~(M • R) 2. M 3. (~R ⊃ B) • (A ⊃ K) / ∴ B ∨ K. Proof: 4. ~M ∨ ~R — 1, De M.; 5. ~~M — 2, D.N.; 6. ~R — 4, 5, D.S.; 7. ~R ⊃ B — 3, Simp.; 8. B — 7, 6, M.P.; 9. B ∨ K — 8, Add. (2) 1. B • A 2. ~A ∨ S 3. S ⊃ T / ∴ T ∨ (~R ⊃ M). Proof: 4. A • B — 1, Com.; 5. A — 4, Simp.; 6. ~~A — 5, D.N.; 7. S — 2, 6, D.S.; 8. T — 3, 7, M.P.; 9. T ∨ (~R ⊃ M) — 8, Add. (3) 1. A ∨ (B ∨ M) 2. ~B / ∴ A ∨ M. Proof: 3. A ∨ (M ∨ B) — 1, Com.; 4. (A ∨ M) ∨ B — 3, Assoc.; 5. B ∨ (A ∨ M) — 4, Com.; 6. A ∨ M — 5, 2, D.S. (4) 1. M ⊃ N 2. A ⊃ N 3. M ∨ A / ∴ N. Proof: 4. (M ⊃ N) • (A ⊃ N) — 1, 2, Conj.; 5. N ∨ N — 4, 3, C.D.; 6. N — 5, Taut. (5) 1. R ∨ (S • T) 2. ~T 3. ~S / ∴ R. Proof: 4. (R ∨ S) • (R ∨ T) — 1, Dist.; 5. R ∨ S — 4, Simp.; 6. S ∨ R — 5, Com.; 7. R — 6, 3, D.S. (6) 1. ~(S ∨ T) 2. ~S ⊃ ~P 3. P ∨ R / ∴ R ∨ ~M. Proof: 4. ~S • ~T — 1, De M.; 5. ~S — 4, Simp.; 6. ~P — 2, 5, M.P.; 7. R — 3, 6, D.S.; 8. R ∨ ~M — 7, Add. (7) 1. A ⊃ ~B 2. A • S 3. B ∨ R / ∴ R • S. Proof: 4. A — 2, Simp.; 5. ~B — 1, 4, M.P.; 6. R — 3, 5, D.S.; 7. S • A — 2, Com.; 8. S — 7, Simp.; 9. R • S — 6, 8, Conj. (8) 1. T ⊃ ~S 2. T ∨ T 3. S ∨ ~K / ∴ ~K ∨ ~K. Proof: 4. T — 2, Taut.; 5. ~S — 1, 4, M.P.; 6. ~K — 3, 5, D.S.; 7. ~K ∨ ~K — 6, Taut. (9) 1. ~K ⊃ ~T 2. ~K • S 3. ~T ⊃ R 4. (R • S) ⊃ M / ∴ M ∨ M. Proof: 5. ~K — 2, Simp.; 6. ~T — 1, 5, M.P.; 7. R — 3, 6, M.P.; 8. S • ~K — 2, Com.; 9. S — 8, Simp.; 10. R • S — 7, 9, Conj.; 11. M — 4, 10, M.P.; 12. M ∨ M — 11, Taut. (10) 1. S ⊃ T 2. T ⊃ M / ∴ M ∨ ~S. Proof: 3. S ⊃ M — 1, 2, H.S.; 4. ~S ∨ M — 3, Impl.; 5. M ∨ ~S — 4, Com.
9. Q.11 (11–20) Formal proofs using inference and replacement.
Answer: (11) 1. A ⊃ M 2. (~A ∨ M) ⊃ R 3. ~S ∨ T / ∴ (S ⊃ T) • R. Proof: 4. ~A ∨ M — 1, Impl.; 5. R — 2, 4, M.P.; 6. S ⊃ T — 3, Impl.; 7. (S ⊃ T) • R — 6, 5, Conj. (12) 1. A ⊃ (B ⊃ M) 2. A • B / ∴ M • [(A • B) ⊃ M]. Proof: 3. (A • B) ⊃ M — 1, Exp.; 4. M — 3, 2, M.P.; 5. M • [(A • B) ⊃ M] — 4, 3, Conj. (13) 1. P ≡ S 2. ~P / ∴ ~S ∨ ~M. Proof: 3. (P • S) ∨ (~P • ~S) — 1, Equiv.; 4. ~P ∨ ~S — 2, Add.; 5. ~(P • S) — 4, De M.; 6. ~P • ~S — 3, 5, D.S.; 7. ~S • ~P — 6, Com.; 8. ~S — 7, Simp.; 9. ~S ∨ ~M — 8, Add. (14) 1. A ∨ (R ∨ ~P) 2. P / ∴ A ∨ R. Proof: 3. (A ∨ R) ∨ ~P — 1, Assoc.; 4. ~P ∨ (A ∨ R) — 3, Com.; 5. ~~P — 2, D.N.; 6. A ∨ R — 4, 5, D.S. (15) 1. W ∨ B 2. W ⊃ ~S 3. B ⊃ ~S 4. T ⊃ S / ∴ ~T. Proof: 5. (W ⊃ ~S) • (B ⊃ ~S) — 2, 3, Conj.; 6. ~S ∨ ~S — 5, 1, C.D.; 7. ~S — 6, Taut.; 8. ~T — 4, 7, M.T. (16) 1. ~B ∨ M 2. M ⊃ R / ∴ ~R ⊃ ~B. Proof: 3. B ⊃ M — 1, Impl.; 4. B ⊃ R — 3, 2, H.S.; 5. ~R ⊃ ~B — 4, Trans. (17) 1. (S • T) ⊃ P 2. P ⊃ F 3. ~F / ∴ ~S ∨ ~T. Proof: 4. (S • T) ⊃ F — 1, 2, H.S.; 5. ~(S • T) — 4, 3, M.T.; 6. ~S ∨ ~T — 5, De M. (18) 1. (R ⊃ Q) • (Q ⊃ R) 2. (B ∨ M) ∨ S 3. ~B 4. ~S / ∴ (R ≡ Q) • M. Proof: 5. R ≡ Q — 1, Equiv.; 6. B ∨ M — 2, 4, D.S.; 7. M — 6, 3, D.S.; 8. (R ≡ Q) • M — 5, 7, Conj. (19) 1. ~(S ∨ M) 2. P ⊃ M 3. M ∨ ~N / ∴ ~(P ∨ N). Proof: 4. ~S • ~M — 1, De M.; 5. ~M • ~S — 4, Com.; 6. ~M — 5, Simp.; 7. ~P — 2, 6, M.T.; 8. ~N — 3, 6, D.S.; 9. ~P • ~N — 7, 8, Conj.; 10. ~(P ∨ N) — 9, De M. (20) 1. S ∨ T 2. (S ∨ M) ⊃ (Q • B) 3. ~B / ∴ T. Proof: 4. ~B ∨ ~Q — 3, Add.; 5. ~Q ∨ ~B — 4, Com.; 6. ~(Q • B) — 5, De M.; 7. ~(S ∨ M) — 2, 6, M.T.; 8. ~S • ~M — 7, De M.; 9. ~S — 8, Simp.; 10. T — 1, 9, D.S.
10. Q.11 (21–30) Formal proofs using inference and replacement.
Answer: (21) 1. ~(~A ∨ R) 2. R / ∴ T • A. Proof: 3. ~~A • ~R — 1, De M.; 4. ~R • ~~A — 3, Com.; 5. ~R — 4, Simp.; 6. R ∨ (T • A) — 2, Add.; 7. T • A — 6, 5, D.S. (22) 1. (R • M) ⊃ S 2. R / ∴ ~S ⊃ ~M. Proof: 3. R ⊃ (M ⊃ S) — 1, Exp.; 4. M ⊃ S — 3, 2, M.P.; 5. ~S ⊃ ~M — 4, Trans. (23) 1. (S • T) ∨ (~S • ~T) 2. ~S ∨ ~R 3. ~(~S • ~T) / ∴ ~(R • B) • (S ≡ T). Proof: 4. (~S • ~T) ∨ (S • T) — 1, Com.; 5. S • T — 4, 3, D.S.; 6. S — 5, Simp.; 7. ~~S — 6, D.N.; 8. ~R — 2, 7, D.S.; 9. ~R ∨ ~B — 8, Add.; 10. ~(R • B) — 9, De M.; 11. S ≡ T — 1, Equiv.; 12. ~(R • B) • (S ≡ T) — 10, 11, Conj. (24) 1. ~A ∨ B 2. S ⊃ T 3. A ∨ S / ∴ ~B ⊃ T. Proof: 4. A ⊃ B — 1, Impl.; 5. (A ⊃ B) • (S ⊃ T) — 4, 2, Conj.; 6. B ∨ T — 5, 3, C.D.; 7. ~~B ∨ T — 6, D.N.; 8. ~B ⊃ T — 7, Impl. (25) 1. ~(A ∨ M) 2. S ⊃ A 3. M ∨ ~R / ∴ ~(S ∨ R). Proof: 4. ~A • ~M — 1, De M.; 5. ~A — 4, Simp.; 6. ~S — 2, 5, M.T.; 7. ~M • ~A — 4, Com.; 8. ~M — 7, Simp.; 9. ~R — 3, 8, D.S.; 10. ~S • ~R — 6, 9, Conj.; 11. ~(S ∨ R) — 10, De M. (26) 1. R ∨ (S • T) 2. (R ∨ T) ⊃ ~M / ∴ M ⊃ F. Proof: 3. (R ∨ S) • (R ∨ T) — 1, Dist.; 4. (R ∨ T) • (R ∨ S) — 3, Com.; 5. R ∨ T — 4, Simp.; 6. ~M — 2, 5, M.P.; 7. ~M ∨ F — 6, Add.; 8. M ⊃ F — 7, Impl. (27) 1. S ⊃ A 2. B ⊃ S 3. ~T • ~A / ∴ ~B • ~T. Proof: 4. B ⊃ A — 2, 1, H.S.; 5. ~A • ~T — 3, Com.; 6. ~A — 5, Simp.; 7. ~B — 4, 6, M.T.; 8. ~T — 3, Simp.; 9. ~B • ~T — 7, 8, Conj. (28) 1. S ⊃ T 2. R ∨ S / ∴ ~T ⊃ R. Proof: 3. S ∨ R — 2, Com.; 4. ~~S ∨ R — 3, D.N.; 5. ~S ⊃ R — 4, Impl.; 6. ~T ⊃ ~S — 1, Trans.; 7. ~T ⊃ R — 6, 5, H.S. (29) 1. (R ⊃ S) • (R ⊃ M) 2. ~S ∨ ~M / ∴ ~(T • R). Proof: 3. ~R ∨ ~R — 1, 2, D.D.; 4. ~R — 3, Taut.; 5. ~R ∨ ~T — 4, Add.; 6. ~T ∨ ~R — 5, Com.; 7. ~(T • R) — 6, De M. (30) 1. B ⊃ K 2. ~B ⊃ S / ∴ (K ∨ S) ∨ ~A. Proof: 3. ~~B ∨ S — 2, Impl.; 4. B ∨ S — 3, D.N.; 5. S ∨ B — 4, Com.; 6. ~~S ∨ B — 5, D.N.; 7. ~S ⊃ B — 6, Impl.; 8. ~S ⊃ K — 7, 1, H.S.; 9. ~~S ∨ K — 8, Impl.; 10. S ∨ K — 9, D.N.; 11. K ∨ S — 10, Com.; 12. (K ∨ S) ∨ ~A — 11, Add.
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. From 'p ⊃ q' and '~q' we infer '~p' by…
Answer: C. Deny the consequent.
2. 'p ∴ p ∨ q' is the rule of…
Answer: B. Any disjunct may be added.
3. Deductive proof as a method is NOT…
Answer: D. Using it needs intelligence.
4. ~(S • ~R) ≡ … by De Morgan's law
Answer: B. Change • to ∨ and negate each part.
5. (K ⊃ T) ≡ … by Transposition
Answer: A. Swap and negate both.
6. (B ⊃ ~R) ≡ … by Material Implication
Answer: D. p ⊃ q becomes ~p ∨ q.
7. [(p • q) ⊃ r] ≡ [p ⊃ (q ⊃ r)] is…
Answer: A. A three-component conditional.
8. ~T ≡ (~T ∨ ~T) is by…
Answer: B. p ≡ (p ∨ p).
9. Which rule needs a conjunction of two conditionals and a disjunction denying the consequents?
Answer: A. D.D. concludes ~p ∨ ~r.
10. Rules of replacement can be applied to…
Answer: A. Equivalent parts may be swapped.
11. H.S. rests on the nature of the…
Answer: B. It chains two conditionals.
12. To infer B from A • B you need…
Answer: A. Simp. gives only the first conjunct.
13. From 'A ∨ B' and '~B', D.S. can be used after…
Answer: A. D.S. needs the first disjunct denied.
14. Another name for the rule of replacement is the principle of…
Answer: D. Equivalent expressions may replace each other.
15. Which pair is a correct equivalence?
Answer: C. That one is Transposition.
Get a ✓ Verified tutor for “The Method of Deduction” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise The Method of Deduction 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 60 minutes
Get a ✓ Verified tutor for “The Method of Deduction” — 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 The Method of Deduction.
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 “The Method of Deduction” — 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.