Decision ProcedureClass 11 Logic Chapter 3 Notes – Maharashtra Board

Textbook: Logic – Class 11 (Balbharati, official free PDF) · pages 31–45

How can you be sure that a statement form is always true, or that an argument is valid, without guessing? This chapter teaches the truth table — a reliable, mechanical and finite decision procedure. Learn to build the matrix (2ⁿ rows), fill the table column by column, sort statement forms into tautology, contradiction and contingency, and test arguments for validity — with every Q.8, Q.9 and Q.10 table worked out and checked.

🎧 Listen to the summary

Summary: Decision Procedure

A decision procedure is a method for deciding whether something belongs to a certain class — here, whether a statement form is tautologous, contradictory or contingent, and whether an argument form is valid. To be effective it must be reliable (always gives the right answer if used correctly), mechanical (just follow steps, no imagination needed) and finite (has a last step). The book lists five: truth table, shorter truth table, truth tree, conjunctive normal form and disjunctive normal form.

A truth table sets out the truth value of a truth-functional form under every possible combination of truth values of its variables. The matrix on the left lists those combinations; the number of rows is 2ⁿ, where n is the number of distinct variables (2, 4, 8, 16, 32…). Variables are written in alphabetical order.

To fill the table, copy each variable's column under every occurrence of that variable, work out the innermost connectives first (negations, then brackets) and finish with the main connective. The column under the main connective is the answer column.

All T under the main connective = tautology; all F = contradiction; a mix = contingency. Denying a tautology gives a contradiction, denying a contradiction gives a tautology, and denying a contingency gives another contingency.

For an argument, write premises and conclusion side by side. Look only at the rows where every premise is true: if the conclusion is true in all of them, the form is valid; if even one such row has a false conclusion, it is invalid. An argument is valid or invalid according to the form it is a substitution instance of.

Key points to remember

  • Decision procedure = a way to settle whether a thing belongs to a given class
  • Effective decision procedure: reliable, mechanical, finite
  • Five decision procedures: truth table, shorter truth table, truth tree, CNF, DNF
  • Number of rows = 2ⁿ (n = number of distinct variables)
  • Matrix: first variable alternates in blocks of half the rows, the last variable alternates T, F, T, F
  • Work from the inside out; the main connective is solved last
  • Tautology: all T; contradiction: all F; contingency: some T, some F
  • ~ tautology = contradiction; ~ contradiction = tautology; ~ contingency = contingency
  • Argument valid if no row has all premises T and conclusion F
  • If premises are never all true together, the argument form is (trivially) valid
Want a teacher to explain Decision Procedure?

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

Get a tutor for this chapter →

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