TalentJR apps
Textbook: Logic – Class 12 (Balbharati, official free PDF) · pages 9–16
Truth tables decide validity, but with many letters they get long and slow. A deductive proof shows validity instead, using a chain of steps that each follow a rule. In Class 11 you built direct proofs with the nine rules of inference and ten rules of replacement. This chapter adds two powerful tools: Conditional Proof (assume the antecedent) and Indirect Proof (assume the opposite and reach a contradiction). Every one of the 38 Q.5 proofs is worked out below and checked line by line.
Logicians use two kinds of method for arguments. Decision procedures (truth table, shorter truth table, truth tree) decide mechanically whether an argument is valid or invalid. Deductive proofs (direct, conditional and indirect) are not decision procedures. They can only establish that a valid argument is valid, and if you fail to find a proof that does not show the argument is invalid.
A direct deductive proof reaches the conclusion from the premises using elementary valid argument forms. There are nine rules of inference (M.P., M.T., H.S., D.S., C.D., D.D., Conj., Simp., Add.), which may be applied only to whole lines. There are also ten rules of replacement (D.N., De M., Assoc., Dist., Trans., Comm., M.Imp., M.Equi., Exp., Taut.), which may be applied to a whole line or to any part of it.
Conditional Proof (C.P.) is used when the conclusion is an implication X ⊃ Y. Assume the antecedent X as an extra premise and derive the consequent Y. Then close (discharge) the assumption and write X ⊃ Y, justified as 'first–last line, C.P.'. A bent arrow marks how far the assumption's scope runs. If the conclusion contains nested implications, you may assume each antecedent in turn, one scope inside the other.
Indirect Proof (I.P.) rests on reductio ad absurdum. Assume the negation of the conclusion and use it with the premises to derive a contradiction of the form A • ~A. The contradiction shows that the assumption is false, so the conclusion is proved. Unlike C.P., this method works whatever the form of the conclusion.
C.P. often gives shorter proofs, and together with I.P. it can prove arguments that are hard to prove directly. Every step still needs a line number and a justification (lines used plus rule name).
Get a ✓ Verified tutor for “Deductive Proof” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Prove by C.P.: 1. A ⊃ B 2. B ⊃ C / ∴ A ⊃ (B • C)
Answer: The antecedent A was assumed, the consequent B • C was derived, and the scope was closed at line 6, so the argument is valid.
Prove by I.P.: 1. P ∨ Q 2. P ⊃ R 3. ~R / ∴ Q
Answer: Assuming ~Q forces R • ~R, a contradiction, so ~Q is false and Q follows: the argument is valid.
| Rule (abbreviation) | Form | Applies to |
|---|---|---|
| Modus Ponens (M.P.) | p ⊃ q, p ∴ q | Whole lines |
| Modus Tollens (M.T.) | p ⊃ q, ~q ∴ ~p | Whole lines |
| Hypothetical Syllogism (H.S.) | p ⊃ q, q ⊃ r ∴ p ⊃ r | Whole lines |
| Disjunctive Syllogism (D.S.) | p ∨ q, ~p ∴ q | Whole lines |
| Constructive / Destructive Dilemma (C.D. / D.D.) | (p ⊃ q) • (r ⊃ s), p ∨ r ∴ q ∨ s / … , ~q ∨ ~s ∴ ~p ∨ ~r | Whole lines |
| Conj., Simp., Add. | p, q ∴ p • q; p • q ∴ p; p ∴ p ∨ q | Whole lines |
| D.N., De M., Comm., Assoc., Dist. | ~~p ≡ p; ~(p • q) ≡ (~p ∨ ~q); (p ∨ q) ≡ (q ∨ p) … | Whole line or any part |
| Trans., M.Imp., M.Equi., Exp., Taut. | (p ⊃ q) ≡ (~q ⊃ ~p); (p ⊃ q) ≡ (~p ∨ q); [(p • q) ⊃ r] ≡ [p ⊃ (q ⊃ r)]; p ≡ (p • p) | Whole line or any part |
| C.P. | Assume X … derive Y; then X ⊃ Y | Conclusion must be an implication |
| I.P. | Assume ~C … derive A • ~A | Any conclusion |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q.1 Fill in the blanks (1–11).
Answer: (1) Modus Ponens. (2) Transposition. (3) rules based on the rule of replacement. (4) Disjunction. (5) (p • ~q). (6) Material Implication. (7) Conditional Proof. (8) M.T. (9) Indirect Proof. (10) Tautology. (11) Indirect Proof.
2. Q.2 True or false (1–9); Q.3 Match; Q.4 Logical terms (1–5).
Answer: Q.2: (1) False: D.S. is a rule of inference, used on whole lines only. (2) False: ~~p ≡ p is Double Negation. (3) True. (4) False: C.P. proves validity; it does not decide between valid and invalid. (5) True. (6) False: it needs insight to choose steps, so it is not mechanical. (7) True. (8) True. (9) False: they are called rules of inference. Q.3: (1)–(d), (2)–(a), (3)–(b), (4)–(c). Q.4: (1) Rules of inference. (2) Rules of inference. (3) Indirect Proof. (4) Indirect Proof. (5) Conditional Proof.
3. Activity boxes: give justifications. (A) C.P.: 1. (P • Q) ⊃ S / ∴ ~S ⊃ [P ⊃ (~Q ∨ T)]; 2. ~S 3. ~(P • Q) 4. ~P ∨ ~Q 5. P 6. ~~P 7. ~Q 8. ~Q ∨ T 9. P ⊃ (~Q ∨ T) 10. ~S ⊃ [P ⊃ (~Q ∨ T)]. (B) I.P.: 1. (H ∨ K) ⊃ (N • B) 2. B ⊃ ~C 3. C / ∴ ~H; 4. ~~H 5. H 6. H ∨ K 7. N • B 8. B • N 9. B 10. ~C 11. C • ~C.
Answer: (A) 2 assumption (C.P.); 3 1, 2 M.T.; 4 3 De M.; 5 assumption (C.P.); 6 5 D.N.; 7 4, 6 D.S.; 8 7 Add.; 9 5–8 C.P.; 10 2–9 C.P. (B) 4 I.P.; 5 4 D.N.; 6 5 Add.; 7 1, 6 M.P.; 8 7 Comm.; 9 8 Simp.; 10 2, 9 M.P.; 11 3, 10 Conj.
4. Q.5 (1–6) Construct a Conditional Proof or Indirect Proof: (1) ~A / ∴ A ⊃ B (2) (L ∨ M) ⊃ (P • Q), ~P / ∴ ~L (3) (S • A) ⊃ R, ~R, A / ∴ ~S (4) Q ∨ (P ∨ R) / ∴ ~Q ⊃ (~R ⊃ (P ∨ S)) (5) A ∨ (B ⊃ D), A ⊃ C, B / ∴ ~C ⊃ D (6) D ⊃ E, D ∨ G / ∴ E ∨ G
Answer: (1) C.P.: 1. ~A / ∴ A ⊃ B; 2. A (assumption for C.P.); 3. A ∨ B (2 Add.); 4. B (3, 1 D.S.); 5. A ⊃ B (2-4 C.P.). (2) I.P.: 1. (L ∨ M) ⊃ (P • Q); 2. ~P / ∴ ~L; 3. ~~L (I.P.); 4. L (3 D.N.); 5. L ∨ M (4 Add.); 6. P • Q (1, 5 M.P.); 7. P (6 Simp.); 8. P • ~P (7, 2 Conj.). (3) I.P.: 1. (S • A) ⊃ R; 2. ~R; 3. A / ∴ ~S; 4. ~~S (I.P.); 5. S (4 D.N.); 6. S • A (5, 3 Conj.); 7. R (1, 6 M.P.); 8. R • ~R (7, 2 Conj.). (4) C.P.: 1. Q ∨ (P ∨ R) / ∴ ~Q ⊃ (~R ⊃ (P ∨ S)); 2. ~Q (assumption for C.P.); 3. ~R (assumption for C.P.); 4. P ∨ R (1, 2 D.S.); 5. R ∨ P (4 Comm.); 6. P (5, 3 D.S.); 7. P ∨ S (6 Add.); 8. ~R ⊃ (P ∨ S) (3-7 C.P.); 9. ~Q ⊃ (~R ⊃ (P ∨ S)) (2-8 C.P.). (5) C.P.: 1. A ∨ (B ⊃ D); 2. A ⊃ C; 3. B / ∴ ~C ⊃ D; 4. ~C (assumption for C.P.); 5. ~A (2, 4 M.T.); 6. B ⊃ D (1, 5 D.S.); 7. D (6, 3 M.P.); 8. ~C ⊃ D (4-7 C.P.). (6) I.P.: 1. D ⊃ E; 2. D ∨ G / ∴ E ∨ G; 3. ~(E ∨ G) (I.P.); 4. ~E • ~G (3 De M.); 5. ~E (4 Simp.); 6. ~D (1, 5 M.T.); 7. G (2, 6 D.S.); 8. ~G • ~E (4 Comm.); 9. ~G (8 Simp.); 10. G • ~G (7, 9 Conj.).
5. Q.5 (7–12) Construct a Conditional Proof or Indirect Proof: (7) W ⊃ L, T ⊃ (~P • L), W ∨ T / ∴ L (8) T ∨ B, (T ∨ N) ⊃ (L • S), ~S / ∴ B (9) R ⊃ (Q ⊃ P), S ⊃ R, T ⊃ Q, ~P / ∴ S ⊃ ~T (10) A ∨ B, (C ∨ D) ⊃ E / ∴ (~A ⊃ (B ∨ F)) • (D ⊃ E) (11) (G ⊃ H) ⊃ J, ~J / ∴ G (12) L ⊃ (M ∨ N), T ∨ L / ∴ ~M ⊃ (~T ⊃ N)
Answer: (7) I.P.: 1. W ⊃ L; 2. T ⊃ (~P • L); 3. W ∨ T / ∴ L; 4. ~L (I.P.); 5. ~W (1, 4 M.T.); 6. T (3, 5 D.S.); 7. ~P • L (2, 6 M.P.); 8. L • ~P (7 Comm.); 9. L (8 Simp.); 10. L • ~L (9, 4 Conj.). (8) I.P.: 1. T ∨ B; 2. (T ∨ N) ⊃ (L • S); 3. ~S / ∴ B; 4. ~B (I.P.); 5. B ∨ T (1 Comm.); 6. T (5, 4 D.S.); 7. T ∨ N (6 Add.); 8. L • S (2, 7 M.P.); 9. S • L (8 Comm.); 10. S (9 Simp.); 11. S • ~S (10, 3 Conj.). (9) C.P.: 1. R ⊃ (Q ⊃ P); 2. S ⊃ R; 3. T ⊃ Q; 4. ~P / ∴ S ⊃ ~T; 5. S (assumption for C.P.); 6. R (2, 5 M.P.); 7. Q ⊃ P (1, 6 M.P.); 8. ~Q (7, 4 M.T.); 9. ~T (3, 8 M.T.); 10. S ⊃ ~T (5-9 C.P.). (10) C.P.: 1. A ∨ B; 2. (C ∨ D) ⊃ E / ∴ (~A ⊃ (B ∨ F)) • (D ⊃ E); 3. ~A (assumption for C.P.); 4. B (1, 3 D.S.); 5. B ∨ F (4 Add.); 6. ~A ⊃ (B ∨ F) (3-5 C.P.); 7. D (assumption for C.P.); 8. D ∨ C (7 Add.); 9. C ∨ D (8 Comm.); 10. E (2, 9 M.P.); 11. D ⊃ E (7-10 C.P.); 12. (~A ⊃ (B ∨ F)) • (D ⊃ E) (6, 11 Conj.). (11) I.P.: 1. (G ⊃ H) ⊃ J; 2. ~J / ∴ G; 3. ~G (I.P.); 4. ~(G ⊃ H) (1, 2 M.T.); 5. ~(~G ∨ H) (4 M.Imp.); 6. ~~G • ~H (5 De M.); 7. ~~G (6 Simp.); 8. G (7 D.N.); 9. G • ~G (8, 3 Conj.). (12) C.P.: 1. L ⊃ (M ∨ N); 2. T ∨ L / ∴ ~M ⊃ (~T ⊃ N); 3. ~M (assumption for C.P.); 4. ~T (assumption for C.P.); 5. L (2, 4 D.S.); 6. M ∨ N (1, 5 M.P.); 7. N (6, 3 D.S.); 8. ~T ⊃ N (4-7 C.P.); 9. ~M ⊃ (~T ⊃ N) (3-8 C.P.).
6. Q.5 (13–18) Construct a Conditional Proof or Indirect Proof: (13) A ⊃ B, C ⊃ D / ∴ (A • C) ⊃ (B • D) (14) K ∨ (T • ~W), W ∨ S / ∴ K ∨ S (15) A ∨ (B ⊃ C), C ⊃ D, ~D, B ∨ E / ∴ ~A ⊃ E (16) P ⊃ (Q ⊃ R), (Q • S) ∨ W / ∴ ~R ⊃ (P ⊃ W) (17) (A • B) ∨ C, (C ∨ D) ⊃ E / ∴ ~A ⊃ E (18) ~K ∨ G, G ⊃ I, ~I / ∴ ~K
Answer: (13) C.P.: 1. A ⊃ B; 2. C ⊃ D / ∴ (A • C) ⊃ (B • D); 3. A • C (assumption for C.P.); 4. A (3 Simp.); 5. B (1, 4 M.P.); 6. C • A (3 Comm.); 7. C (6 Simp.); 8. D (2, 7 M.P.); 9. B • D (5, 8 Conj.); 10. (A • C) ⊃ (B • D) (3-9 C.P.). (14) I.P.: 1. K ∨ (T • ~W); 2. W ∨ S / ∴ K ∨ S; 3. ~(K ∨ S) (I.P.); 4. ~K • ~S (3 De M.); 5. ~K (4 Simp.); 6. T • ~W (1, 5 D.S.); 7. ~W • T (6 Comm.); 8. ~W (7 Simp.); 9. S (2, 8 D.S.); 10. ~S • ~K (4 Comm.); 11. ~S (10 Simp.); 12. S • ~S (9, 11 Conj.). (15) C.P.: 1. A ∨ (B ⊃ C); 2. C ⊃ D; 3. ~D; 4. B ∨ E / ∴ ~A ⊃ E; 5. ~A (assumption for C.P.); 6. B ⊃ C (1, 5 D.S.); 7. ~C (2, 3 M.T.); 8. ~B (6, 7 M.T.); 9. E (4, 8 D.S.); 10. ~A ⊃ E (5-9 C.P.). (16) C.P.: 1. P ⊃ (Q ⊃ R); 2. (Q • S) ∨ W / ∴ ~R ⊃ (P ⊃ W); 3. ~R (assumption for C.P.); 4. P (assumption for C.P.); 5. Q ⊃ R (1, 4 M.P.); 6. ~Q (5, 3 M.T.); 7. ~Q ∨ ~S (6 Add.); 8. ~(Q • S) (7 De M.); 9. W (2, 8 D.S.); 10. P ⊃ W (4-9 C.P.); 11. ~R ⊃ (P ⊃ W) (3-10 C.P.). (17) C.P.: 1. (A • B) ∨ C; 2. (C ∨ D) ⊃ E / ∴ ~A ⊃ E; 3. ~A (assumption for C.P.); 4. ~A ∨ ~B (3 Add.); 5. ~(A • B) (4 De M.); 6. C (1, 5 D.S.); 7. C ∨ D (6 Add.); 8. E (2, 7 M.P.); 9. ~A ⊃ E (3-8 C.P.). (18) I.P.: 1. ~K ∨ G; 2. G ⊃ I; 3. ~I / ∴ ~K; 4. ~~K (I.P.); 5. G (1, 4 D.S.); 6. I (2, 5 M.P.); 7. I • ~I (6, 3 Conj.).
7. Q.5 (19–24) Construct a Conditional Proof or Indirect Proof: (19) D ⊃ E / ∴ D ⊃ (D • E) (20) F ⊃ (G ⊃ H), G ⊃ (H ⊃ J) / ∴ F ⊃ (G ⊃ J) (21) R ⊃ (S • T), (S ∨ U) ⊃ W, U ∨ R / ∴ W (22) (P ∨ Q) ⊃ ((R ∨ S) ⊃ T) / ∴ P ⊃ ((R • U) ⊃ T) (23) (A ⊃ B) • (C ⊃ D), ~B / ∴ (A ∨ C) ⊃ D (24) (K ∨ G) ⊃ (H • I), (I ∨ M) ⊃ O / ∴ K ⊃ O
Answer: (19) C.P.: 1. D ⊃ E / ∴ D ⊃ (D • E); 2. D (assumption for C.P.); 3. E (1, 2 M.P.); 4. D • E (2, 3 Conj.); 5. D ⊃ (D • E) (2-4 C.P.). (20) C.P.: 1. F ⊃ (G ⊃ H); 2. G ⊃ (H ⊃ J) / ∴ F ⊃ (G ⊃ J); 3. F (assumption for C.P.); 4. G (assumption for C.P.); 5. G ⊃ H (1, 3 M.P.); 6. H (5, 4 M.P.); 7. H ⊃ J (2, 4 M.P.); 8. J (7, 6 M.P.); 9. G ⊃ J (4-8 C.P.); 10. F ⊃ (G ⊃ J) (3-9 C.P.). (21) I.P.: 1. R ⊃ (S • T); 2. (S ∨ U) ⊃ W; 3. U ∨ R / ∴ W; 4. ~W (I.P.); 5. ~(S ∨ U) (2, 4 M.T.); 6. ~S • ~U (5 De M.); 7. ~U • ~S (6 Comm.); 8. ~U (7 Simp.); 9. R (3, 8 D.S.); 10. S • T (1, 9 M.P.); 11. S (10 Simp.); 12. ~S (6 Simp.); 13. S • ~S (11, 12 Conj.). (22) C.P.: 1. (P ∨ Q) ⊃ ((R ∨ S) ⊃ T) / ∴ P ⊃ ((R • U) ⊃ T); 2. P (assumption for C.P.); 3. R • U (assumption for C.P.); 4. P ∨ Q (2 Add.); 5. (R ∨ S) ⊃ T (1, 4 M.P.); 6. R (3 Simp.); 7. R ∨ S (6 Add.); 8. T (5, 7 M.P.); 9. (R • U) ⊃ T (3-8 C.P.); 10. P ⊃ ((R • U) ⊃ T) (2-9 C.P.). (23) C.P.: 1. (A ⊃ B) • (C ⊃ D); 2. ~B / ∴ (A ∨ C) ⊃ D; 3. A ∨ C (assumption for C.P.); 4. A ⊃ B (1 Simp.); 5. ~A (4, 2 M.T.); 6. C (3, 5 D.S.); 7. (C ⊃ D) • (A ⊃ B) (1 Comm.); 8. C ⊃ D (7 Simp.); 9. D (8, 6 M.P.); 10. (A ∨ C) ⊃ D (3-9 C.P.). (24) C.P.: 1. (K ∨ G) ⊃ (H • I); 2. (I ∨ M) ⊃ O / ∴ K ⊃ O; 3. K (assumption for C.P.); 4. K ∨ G (3 Add.); 5. H • I (1, 4 M.P.); 6. I • H (5 Comm.); 7. I (6 Simp.); 8. I ∨ M (7 Add.); 9. O (2, 8 M.P.); 10. K ⊃ O (3-9 C.P.).
8. Q.5 (25–31) Construct a Conditional Proof or Indirect Proof: (25) (R • R) ⊃ Q, Q ⊃ ~R / ∴ ~R (26) ~P ⊃ S, ~Q ⊃ P, ~Q ∨ ~S / ∴ P (27) (~P ∨ Q) ⊃ S / ∴ ~S ⊃ ~Q (28) ~F ⊃ (G ⊃ ~H), L ∨ ~F, H ∨ ~M / ∴ ~L ⊃ (G ⊃ ~M) (29) B ⊃ C, D ⊃ E, (C • E) ⊃ G / ∴ (B • D) ⊃ G (30) U ⊃ (W ∨ X), ~~U • ~X, (Y ∨ W) ⊃ Z / ∴ Z (31) D ⊃ G, D ∨ H / ∴ G ∨ H
Answer: (25) I.P.: 1. (R • R) ⊃ Q; 2. Q ⊃ ~R / ∴ ~R; 3. ~~R (I.P.); 4. R (3 D.N.); 5. R • R (4 Taut.); 6. Q (1, 5 M.P.); 7. ~R (2, 6 M.P.); 8. R • ~R (4, 7 Conj.). (26) I.P.: 1. ~P ⊃ S; 2. ~Q ⊃ P; 3. ~Q ∨ ~S / ∴ P; 4. ~P (I.P.); 5. S (1, 4 M.P.); 6. ~~Q (2, 4 M.T.); 7. ~S ∨ ~Q (3 Comm.); 8. ~~S (5 D.N.); 9. ~Q (7, 8 D.S.); 10. ~Q • ~~Q (9, 6 Conj.). (27) C.P.: 1. (~P ∨ Q) ⊃ S / ∴ ~S ⊃ ~Q; 2. ~S (assumption for C.P.); 3. ~(~P ∨ Q) (1, 2 M.T.); 4. ~~P • ~Q (3 De M.); 5. ~Q • ~~P (4 Comm.); 6. ~Q (5 Simp.); 7. ~S ⊃ ~Q (2-6 C.P.). (28) C.P.: 1. ~F ⊃ (G ⊃ ~H); 2. L ∨ ~F; 3. H ∨ ~M / ∴ ~L ⊃ (G ⊃ ~M); 4. ~L (assumption for C.P.); 5. G (assumption for C.P.); 6. ~F (2, 4 D.S.); 7. G ⊃ ~H (1, 6 M.P.); 8. ~H (7, 5 M.P.); 9. ~M (3, 8 D.S.); 10. G ⊃ ~M (5-9 C.P.); 11. ~L ⊃ (G ⊃ ~M) (4-10 C.P.). (29) C.P.: 1. B ⊃ C; 2. D ⊃ E; 3. (C • E) ⊃ G / ∴ (B • D) ⊃ G; 4. B • D (assumption for C.P.); 5. B (4 Simp.); 6. C (1, 5 M.P.); 7. D • B (4 Comm.); 8. D (7 Simp.); 9. E (2, 8 M.P.); 10. C • E (6, 9 Conj.); 11. G (3, 10 M.P.); 12. (B • D) ⊃ G (4-11 C.P.). (30) I.P.: 1. U ⊃ (W ∨ X); 2. ~~U • ~X; 3. (Y ∨ W) ⊃ Z / ∴ Z; 4. ~Z (I.P.); 5. ~(Y ∨ W) (3, 4 M.T.); 6. ~Y • ~W (5 De M.); 7. ~W • ~Y (6 Comm.); 8. ~W (7 Simp.); 9. ~~U (2 Simp.); 10. U (9 D.N.); 11. W ∨ X (1, 10 M.P.); 12. ~X • ~~U (2 Comm.); 13. ~X (12 Simp.); 14. X ∨ W (11 Comm.); 15. W (14, 13 D.S.); 16. W • ~W (15, 8 Conj.). (31) I.P.: 1. D ⊃ G; 2. D ∨ H / ∴ G ∨ H; 3. ~(G ∨ H) (I.P.); 4. ~G • ~H (3 De M.); 5. ~G (4 Simp.); 6. ~D (1, 5 M.T.); 7. H (2, 6 D.S.); 8. ~H • ~G (4 Comm.); 9. ~H (8 Simp.); 10. H • ~H (7, 9 Conj.).
9. Q.5 (32–38) Construct a Conditional Proof or Indirect Proof: (32) ~(P ⊃ Q) ⊃ ~R, S ∨ R / ∴ ~S ⊃ (~P ∨ Q) (33) J ⊃ K, ~(K • L), L / ∴ ~J (34) (P ∨ Q) ⊃ R, ~R ∨ S, ~P ⊃ T, ~S / ∴ T (35) C ∨ (W • S), C ⊃ S / ∴ ~W ⊃ S (36) (A ∨ B) ⊃ C, (B ∨ C) ⊃ (A ⊃ E), D ⊃ A / ∴ D ⊃ E (37) R ⊃ (~P ∨ ~Q), S ⊃ T, T ⊃ Q, P / ∴ S ⊃ ~R (38) A ⊃ (B ⊃ C), B, (E ⊃ T) ⊃ K / ∴ (A ⊃ C) • (T ⊃ K)
Answer: (32) C.P.: 1. ~(P ⊃ Q) ⊃ ~R; 2. S ∨ R / ∴ ~S ⊃ (~P ∨ Q); 3. ~S (assumption for C.P.); 4. R (2, 3 D.S.); 5. ~~R (4 D.N.); 6. ~~(P ⊃ Q) (1, 5 M.T.); 7. P ⊃ Q (6 D.N.); 8. ~P ∨ Q (7 M.Imp.); 9. ~S ⊃ (~P ∨ Q) (3-8 C.P.). (33) I.P.: 1. J ⊃ K; 2. ~(K • L); 3. L / ∴ ~J; 4. ~~J (I.P.); 5. J (4 D.N.); 6. K (1, 5 M.P.); 7. K • L (6, 3 Conj.); 8. (K • L) • ~(K • L) (7, 2 Conj.). (34) I.P.: 1. (P ∨ Q) ⊃ R; 2. ~R ∨ S; 3. ~P ⊃ T; 4. ~S / ∴ T; 5. ~T (I.P.); 6. ~~P (3, 5 M.T.); 7. P (6 D.N.); 8. P ∨ Q (7 Add.); 9. R (1, 8 M.P.); 10. S ∨ ~R (2 Comm.); 11. ~R (10, 4 D.S.); 12. R • ~R (9, 11 Conj.). (35) C.P.: 1. C ∨ (W • S); 2. C ⊃ S / ∴ ~W ⊃ S; 3. ~W (assumption for C.P.); 4. (C ∨ W) • (C ∨ S) (1 Dist.); 5. C ∨ W (4 Simp.); 6. W ∨ C (5 Comm.); 7. C (6, 3 D.S.); 8. S (2, 7 M.P.); 9. ~W ⊃ S (3-8 C.P.). (36) C.P.: 1. (A ∨ B) ⊃ C; 2. (B ∨ C) ⊃ (A ⊃ E); 3. D ⊃ A / ∴ D ⊃ E; 4. D (assumption for C.P.); 5. A (3, 4 M.P.); 6. A ∨ B (5 Add.); 7. C (1, 6 M.P.); 8. C ∨ B (7 Add.); 9. B ∨ C (8 Comm.); 10. A ⊃ E (2, 9 M.P.); 11. E (10, 5 M.P.); 12. D ⊃ E (4-11 C.P.). (37) C.P.: 1. R ⊃ (~P ∨ ~Q); 2. S ⊃ T; 3. T ⊃ Q; 4. P / ∴ S ⊃ ~R; 5. S (assumption for C.P.); 6. T (2, 5 M.P.); 7. Q (3, 6 M.P.); 8. P • Q (4, 7 Conj.); 9. ~~(P • Q) (8 D.N.); 10. ~(~P ∨ ~Q) (9 De M.); 11. ~R (1, 10 M.T.); 12. S ⊃ ~R (5-11 C.P.). (38) C.P.: 1. A ⊃ (B ⊃ C); 2. B; 3. (E ⊃ T) ⊃ K / ∴ (A ⊃ C) • (T ⊃ K); 4. A (assumption for C.P.); 5. B ⊃ C (1, 4 M.P.); 6. C (5, 2 M.P.); 7. A ⊃ C (4-6 C.P.); 8. T (assumption for C.P.); 9. T ∨ ~E (8 Add.); 10. ~E ∨ T (9 Comm.); 11. E ⊃ T (10 M.Imp.); 12. K (3, 11 M.P.); 13. T ⊃ K (8-12 C.P.); 14. (A ⊃ C) • (T ⊃ K) (7, 13 Conj.).
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. C.P. is used only when the conclusion is…
Answer: A. We assume its antecedent.
2. In I.P. we first assume…
Answer: B. Then we look for a contradiction.
3. I.P. is based on the principle of…
Answer: D. Assume the opposite, reach absurdity.
4. Which rule can be applied to a part of a statement?
Answer: D. Rules of replacement work on parts.
5. [(p ⊃ q) • p] ⊃ q corresponds to…
Answer: A. Affirm the antecedent, get the consequent.
6. The last line of an Indirect Proof is…
Answer: D. e.g. N • ~N.
7. ~~p ≡ p is the rule of…
Answer: C. Two negations cancel.
8. 'p ⊃ q, ~q ∴ ~p' is…
Answer: D. Deny the consequent.
9. The C.P. step is justified by…
Answer: A. e.g. 2–4 C.P.
10. Which is a decision procedure?
Answer: C. Proofs are not decision procedures.
11. (p ⊃ q) ≡ (~p ∨ q) is…
Answer: B. Implication rewritten as a disjunction.
12. ~(~p ∨ q) by De Morgan becomes…
Answer: A. Negate both disjuncts and change ∨ to •.
13. For the conclusion ~S ⊃ [P ⊃ (~Q ∨ T)] you assume…
Answer: C. Nested C.P.: each antecedent in turn.
14. Which is a contradiction in the I.P. sense?
Answer: B. One conjunct denies the other.
15. Elementary valid argument forms are called…
Answer: D. The nine one-way forms.
Get a ✓ Verified tutor for “Deductive Proof” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Deductive Proof 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 “Deductive Proof” — 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 Deductive Proof.
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 “Deductive Proof” — 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.