TalentJR apps
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.
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.
Get a ✓ Verified tutor for “Decision Procedure” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Construct the truth table for (p ⊃ q) ⊃ (~q ⊃ ~p) and classify it.
Answer: Rows: TT → T; TF → T; FT → T; FF → T. All T under the main connective, so the form is a tautology.
Test: 'If Neha wins the debate, she gets a trophy. Neha did not win the debate. So she does not get a trophy.' (W, T)
Answer: Invalid — row 3 (p false, q true) has true premises and a false conclusion. (This is the fallacy of denying the antecedent.)
| What you see under the main connective | Verdict | Example |
|---|---|---|
| T in every row | Tautology | p ∨ ~p; p ⊃ (q ⊃ p) |
| F in every row | Contradiction | p • ~p; ~(p ∨ q) • ~(~p • ~q) |
| Some T and some F | Contingency | p ⊃ q; (r ∨ q) ≡ r |
| All premises T and conclusion T in every such row | Valid argument form | p ∨ q, ~p ∴ q |
| At least one row: all premises T, conclusion F | Invalid argument form | p ⊃ q, q ∴ p |
| Premises never all T together | Valid (no counter-example possible) | p ⊃ q, ~q • p ∴ ~p |
| n distinct variables | 2ⁿ rows | 3 variables → 8 rows |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q.1 Fill in the blanks (13) and Q.2 True or false (10).
Answer: Q.1: 1 Truth table. 2 True. 3 False. 4 Contingency. 5 Contradiction. 6 Tautology. 7 Contingency. 8 Tautology. 9 Tautology. 10 Contradiction. 11 Validity. 12 Contradiction. 13 Contingency. Q.2: 1 True (five are listed). 2 True. 3 True. 4 False — a contradiction is false in every row. 5 True. 6 True. 7 False — it is mechanical and needs no intelligence or imagination. 8 True. 9 True. 10 False — it tests only truth-functional deductive arguments, not inductive ones.
2. Q.3 Match, Q.4 Logical terms, Q.5 Reasons.
Answer: Q.3: Tautology — always true; Decision procedure — truth table; Contradiction — always false; Contingency — sometimes true and sometimes false. Q.4: 1 Decision procedure. 2 Truth table. 3 Matrix. 4 Tautology. 5 Contradiction. 6 Contingency. Q.5: (1) It is reliable, mechanical and finite. (2) A tautology is T in every row; negation turns every T into F, so all F — a contradiction. (3) A contradiction is F in every row; negation makes every row T — a tautology. (4) A contingency has some T and some F; negation swaps them, so the result still has some T and some F.
3. Q.6 and Q.7: Explain decision procedure, tautology, contradiction, contingency, the truth table as an effective procedure; differentiate statement form/argument form, tautology/contradiction, contradiction/contingency, tautology/contingency; how to construct a truth table and fix the number of rows.
Answer: Statement form: a single compound pattern such as (p • q) ⊃ r, judged as tautology, contradiction or contingency. Argument form: premises and a conclusion made of variables such as p ⊃ q, p ∴ q, judged as valid or invalid. Tautology (p ∨ ~p: T, T) vs contradiction (p • ~p: F, F): all T vs all F; the denial of one is the other. Contradiction vs contingency: all F vs a mix (p ⊃ q: T, F, T, T). Tautology vs contingency: all T vs a mix. Construction: two columns; write the form; list distinct variables alphabetically; rows = 2ⁿ; fill the matrix by halving; copy values under variables; solve inner connectives first; finish with the main connective and read its column. Effective: reliable, mechanical, finite (see notes).
4. Q.8 (1–10) Construct truth tables and classify.
Answer: (1) p • ~p: T→F, F→F — contradiction. (2) p ⊃ (q ⊃ p) [p q]: TT→T, TF→T, FT→T, FF→T — tautology. (3) p ∨ (r • p) [p r]: TT→T, TF→T, FT→F, FF→F — contingency. (4) (r ∨ q) ≡ r [q r]: TT→T, TF→F, FT→T, FF→T — contingency. (5) (~t • q) ⊃ (q ⊃ t) [q t]: TT→T, TF→F, FT→T, FF→T — contingency. (6) (p ⊃ ~p) • (~p ⊃ q) [p q]: TT→F, TF→F, FT→T, FF→F — contingency. (7) p ⊃ (p ∨ r) [p r]: all four rows T — tautology. (8) ~q ⊃ (q • q): T→T, F→F — contingency. (9) (t ⊃ t) • (t ⊃ ~t): T→F, F→T — contingency. (10) [(p ⊃ s) • p] ⊃ s [p s]: all four T — tautology.
5. Q.8 (11–20) Construct truth tables and classify.
Answer: (11) [q ∨ (p • ~q)] ≡ [~p • (q ∨ p)] [p q]: TT→F, TF→F, FT→T, FF→T — contingency. (12) (p ⊃ t) • ~(~p ∨ p) [p t]: all F — contradiction (the right conjunct is the denial of a tautology). (13) (~p • p) ⊃ [(s ∨ ~p) • (~s ∨ ~p)] [p s]: all T — tautology (the antecedent is always F). (14) (p • p) ∨ ~p: T→T, F→T — tautology. (15) ~{~p ⊃ [(p • q) ∨ p]} [p q]: TT→F, TF→F, FT→T, FF→T — contingency. (16) ~(p ∨ q) • ~(~p • ~q): all F — contradiction. (17) [p • (q • r)] ≡ [(p • q) • r]: all 8 rows T — tautology. (18) [(p ∨ q) • ~p] ⊃ q: all T — tautology. (19) (t ≡ ~q) ⊃ (~q ⊃ t) [q t]: all T — tautology. (20) [p ⊃ (r • q)] ≡ [(p ⊃ q) • (p ⊃ r)]: all 8 rows T — tautology.
6. Q.9 (1–8) Test validity by truth table. (1) ~M ⊃ N, ~N ∴ M • N (2) (P ∨ Q) • P ∴ P (3) P ⊃ (Q • R), ~Q ∨ ~R ∴ ~P (4) Q ⊃ P, ~P ∴ Q (5) (P • Q) ⊃ R, ~R ∴ Q (6) (~P ∨ Q) ⊃ P, P ⊃ R ∴ (P ⊃ Q) ⊃ R (7) ~Q ∨ P ∴ P ⊃ Q (8) (P ≡ Q) ⊃ R, R ∴ ~P ∨ Q
Answer: (1) [M N] premises both T only in TF; conclusion M • N = F there — invalid. (2) [P Q] premise T in TT, TF; conclusion T in both — valid. (3) [P Q R] premises T in FTF, FFT, FFF; ~P is T in all — valid. (4) [P Q] premises T only in FF; Q = F — invalid. (5) [P Q R] premises T in TFF, FTF, FFF; Q = F in TFF and FFF — invalid. (6) [P Q R] premises T in TTT, TFT; conclusion T in both — valid. (7) [P Q] premise T in TT, TF, FF; in TF, P ⊃ Q = F — invalid. (8) [P Q R] premises T in TTT, TFT, FTT, FFT; in TFT, ~P ∨ Q = F — invalid.
7. Q.9 (9–15) (9) ~Q ≡ S, P ≡ Q ∴ Q ∨ ~P (10) ~(A • B), ~B ∴ A (11) J ∨ K, ~J ∴ ~K (12) M ⊃ ~B, ~B ∨ M ∴ B • M (13) ~E • M, ~(M ≡ E) ∴ ~M (14) C ⊃ F, ~F • C ∴ ~C (15) G ≡ W, ~W, ~G ∴ W ⊃ G
Answer: (9) [P Q S] premises T in TTF, FFT; Q ∨ ~P is T in both — valid. (10) [A B] premises T in TF, FF; A = F in FF — invalid. (11) [J K] premises T only in FT; ~K = F — invalid. (12) [B M] premises T in FT, FF; B • M = F in both — invalid. (13) [E M] premises T only in FT; ~M = F — invalid. (14) [C F] rows: TT → T, F; TF → F, T; FT → T, F; FF → T, F. The premises are never true together, so no row can show true premises with a false conclusion — valid. (15) [G W] premises all T only in FF; W ⊃ G = T — valid.
8. Q.10 (1–8) Symbolise and test: (1) Germans (D, P) (2) Nitin Shankar (R, S) (3) Picasso (A, E, D) (4) Kalansh (S, H) (5) Sparsh (M, H) (6) Durvansh (V, F) (7) overeating (O, D, H) (8) Zoey (W, A)
Answer: (1) D ∨ ~P, D ∴ ~P — row D T, P T gives true premises, false conclusion — invalid. (2) R ∴ ~(R • S) — row R T, S T: premise T, conclusion F — invalid. (3) ~A ⊃ E, ~E ∴ A ∨ D — premises T only when A T, E F; then A ∨ D is T — valid. (4) ~(S • H), H ∴ ~S — premises T only when H T, S F; ~S is T — valid. (5) ~(M ⊃ ~H), ~H ∴ M • ~H — the first premise is true only when M and H are both T, which clashes with ~H, so the premises are never all true — valid (trivially). (6) V ∴ V • ~F — row V T, F T: premise T, conclusion F — invalid. (7) O ⊃ (D ∨ H), D • H ∴ O — row D T, H T, O F: premises T, conclusion F — invalid ('some men' is treated as a whole proposition here). (8) W ⊃ A, W ∴ A — premises T only when A T, W T — valid (Modus Ponens).
9. Q.10 (9–16) (9) Riddhi (T, B, M) (10) family planning (F, P) (11) Het and Smit (B, O) (12) books (I, F, K) (13) luck (L, C) (14) rain and crops (R, C) (15) Mann (G, P) (16) Shruti (S, W, V, B); and Activity 6 (1)–(3).
Answer: (9) T ∨ B, T ⊃ M, ~M ∴ B — premises T only when B T, M F, T F; B is T — valid. (10) F ⊃ P, ~F ∴ ~P — row F F, P T: premises T, conclusion F — invalid. (11) B ⊃ O, ~O ∴ B — row B F, O F: premises T, conclusion F — invalid. (12) I ∨ F, F ⊃ K ∴ I ⊃ K — row I T, F F, K F: premises T, conclusion F — invalid. (13) L ∨ C, ~C ∴ L — premises T only when C F, L T — valid. (14) R ⊃ C, C ∴ R — row R F, C T — invalid. (15) G ≡ P, ~G ∴ ~P — premises T only when G F, P F; ~P T — valid. (16) S ≡ W, (V • B) ⊃ W ∴ S — row with all four F: premises T, conclusion F — invalid. Activity 6: (1) E ⊃ ~R, ~~E ∴ ~R — valid. (2) W ⊃ P, ~W ∨ ~P, ~P ∴ ~W — valid. (3) (S ⊃ M) • (G ⊃ F), S ∨ G ∴ M ∨ ~F — invalid (row F T, G T, M F, S F).
10. Q.11 Complete the table of conjunction, disjunction, implication and equivalence for the four rows of left/right components.
Answer: TT: • T, ∨ T, ⊃ T, ≡ T. TF: • F, ∨ T, ⊃ F, ≡ F. FT: • F, ∨ T, ⊃ T, ≡ F. FF: • F, ∨ F, ⊃ T, ≡ T.
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. A truth table with 3 distinct variables has…
Answer: C. 2³ = 8.
2. A form that is false in every row is a…
Answer: C. All F under the main connective.
3. p ∨ ~p is a…
Answer: B. One of the two disjuncts is always true.
4. The denial of a contradiction is a…
Answer: D. Flip all F to all T.
5. Which is NOT a condition of an effective decision procedure?
Answer: C. It must need no imagination.
6. The matrix is written on the…
Answer: B. The form goes on the right.
7. In a truth table, the answer is read under the…
Answer: B. It governs the whole form.
8. An argument form is invalid if some row has…
Answer: A. That is a counter-example.
9. p ⊃ (q ⊃ p) is a…
Answer: C. It is T in all four rows.
10. (r ∨ q) ≡ r is a…
Answer: D. It is F when q is T and r is F.
11. The test 'p ⊃ q, q ∴ p' is…
Answer: B. Row p F, q T has true premises and false conclusion.
12. The test 'p ∨ q, ~p ∴ q' is…
Answer: D. Only row FT has both premises true, and q is T there.
13. Which decision procedure do we study in this chapter?
Answer: B. Others are studied later.
14. The denial of p ⊃ q is…
Answer: A. Denying a contingency gives a contingency.
15. A truth table cannot test…
Answer: A. Inductive strength depends on content, not form.
Get a ✓ Verified tutor for “Decision Procedure” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Decision Procedure 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 50 minutes
Get a ✓ Verified tutor for “Decision Procedure” — 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 Decision Procedure.
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 “Decision Procedure” — 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.