Deductive ProofClass 12 Logic Chapter 2 Notes – Maharashtra Board

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.

🎧 Listen to the summary

Summary: Deductive Proof

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

Key points to remember

  • Decision procedures decide valid or invalid; deductive proofs only prove validity
  • Three deductive proofs: direct, conditional (C.P.), indirect (I.P.)
  • 9 rules of inference apply to whole lines only; 10 replacement rules may apply to parts of a line
  • C.P.: use only when the conclusion is an implication X ⊃ Y
  • C.P.: assume X, derive Y, discharge and write X ⊃ Y as 'a–b, C.P.'
  • The bent arrow shows the scope of an assumption; lines inside a closed scope cannot be used later
  • Nested implication in the conclusion: assume each antecedent, closing the inner scope first
  • I.P.: assume the negation of the conclusion (marked I.P.) and derive A • ~A
  • I.P. is based on reductio ad absurdum and works for any kind of conclusion
  • The last line of an I.P. is a contradiction: one conjunct is the denial of the other
Want a teacher to explain Deductive Proof?

Get a ✓ Verified tutor for “Deductive Proof” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.

Get a tutor for this chapter →

👩‍🏫 Class 12 Logic 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