TalentJR apps
Textbook: Logic – Class 12 (Balbharati, official free PDF) · pages 1–8
A full truth table for four variables needs 16 rows, and for five it needs 32. The shorter truth table does the same job in a single line. You pretend the statement form is false, follow the basic truth tables step by step, and check whether that pretence runs into a clash. This chapter shows how to do the test, how to handle connectives that can be false in more than one way, and works through all 25 forms in Q.5 (each checked against a full truth table).
A decision procedure settles whether an argument is valid or invalid, or whether a statement form is a tautology, contradiction or contingency. It counts as effective only if it is reliable, mechanical and finite. The full truth table meets all three conditions, but it grows fast: 2ⁿ rows for n variables, so 16 rows for four letters and 32 for five. That is slow, and long tables invite careless mistakes.
The shorter truth table is also an effective decision procedure, and it usually fits on one line. It rests on reductio ad absurdum: to prove something, show that its opposite leads to an absurdity. It is called an indirect method because it never shows directly that the form is a tautology. It shows that the form cannot be false.
Method: write F under the main connective and mark it with a star (*). Using the basic truth tables, assign every value that this F forces, numbering each step. Then look for an inconsistency. There are two kinds: a basic truth-table rule is broken, or the same variable gets both T and F. Mark a clash with x.
If the assumption leads to an inconsistency, it was wrong, so the form is a tautology. If you can complete the line with no clash, the assumption holds and the form is not a tautology (it is a contingency or a contradiction).
When F under the main connective can arise in more than one way (• has three false cases and ≡ has two), test each possibility. The form is a tautology only if every possibility ends in a clash. One clash-free possibility is enough to show it is not a tautology, so you can stop there.
Get a ✓ Verified tutor for “Decision Procedure” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Test [(p ⊃ q) • p] ⊃ q by the shorter truth table method.
Answer: x under the bracket's ⊃: the rule of implication is broken. The assumption fails, so the form is a tautology (it is the Modus Ponens pattern).
Test (p ∨ q) ⊃ (p • q).
Answer: No inconsistency on the line p = T, q = F, so the form is not a tautology (a full table shows it is a contingency).
| Value placed under the connective | What you can assign | Remember |
|---|---|---|
| F under ⊃ | Antecedent T, consequent F | Only one way: one line |
| F under ∨ | Both disjuncts F | Only one way: one line |
| F under • | T•F, F•T or F•F | Three possibilities; test each |
| F under ≡ | T≡F or F≡T | Two possibilities; test each |
| F under ~ | The component is T | T under ~ means the component is F |
| T under • | Both conjuncts T | A true ∨, ⊃ or ≡ can arise in several ways, so leave it until other values are fixed |
| A letter gets both T and F | Inconsistency (x) | The assumption fails |
| A connective disagrees with its parts | Inconsistency (x) | e.g. T ⊃ F written under ⊃ as T |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q.1 Fill in the blanks (1–10) and the box activity 'Complete the following' (p • q with T T; p ∨ q with F F; p ⊃ q with T F; p ≡ q with F T; ~p with p T; ~p with p F).
Answer: Q.1: (1) indirect. (2) Shorter Truth Table. (3) true. (4) tautology. (5) false. (6) contradiction. (7) false. (8) decision procedure. (9) true. (10) ~. Boxes: T • T = T; F ∨ F = F; T ⊃ F = F; F ≡ T = F; ~p is F when p is T; ~p is T when p is F.
2. Q.2 True or false (1–11).
Answer: (1) True. (2) False: a conjunction is false if even one conjunct is false. (3) False: • joins two statements, so it is dyadic; ~ is the monadic one. (4) True. (5) False: the shorter method is more convenient than the full table. (6) False: it is the shorter truth table that rests on reductio ad absurdum. (7) True: it is an indirect method. (8) False: a contingency is true in some cases and false in others. (9) True: with a true consequent ⊃ is always true. (10) True. (11) True: p ∨ ~p is true in both rows.
3. Q.3 Match the columns; Q.4 Give logical terms (1–7).
Answer: Q.3: (1) Shorter truth table – (d) reductio ad absurdum. (2) Truth table – (c) direct method. (3) Contradiction – (b) always false. (4) Tautology – (a) always true. Q.4: (1) Tautology. (2) Shorter truth table method. (3) Tautology. (4) Shorter truth table method. (5) Implicative (conditional) statement. (6) Contradiction. (7) Contingency.
4. Q.5 (1–8) Test by the shorter truth table: (1) [(p ⊃ ~q) • q] ⊃ ~p (2) (~p • ~q) • (p ≡ q) (3) (p ⊃ q) ⊃ (~q ⊃ ~p) (4) (p • q) ∨ (q ⊃ p) (5) (p • p) ∨ ~p (6) (q ⊃ ~p) ∨ ~q (7) (~p ⊃ q) • (~p • ~q) (8) [(~p ∨ ~q) • q] ⊃ ~p
Answer: (1) F under ⊃: ~p F so p T; (p ⊃ ~q) • q T so q T and p ⊃ ~q T, but T ⊃ F is F, a clash. Tautology. (2) Main • false. Possibility 1 (T • F): ~p • ~q T gives p F and q F, so p ≡ q is T, not F, a clash. Possibility 2 (F • T): take p T, q T: ~p • ~q is F and p ≡ q is T, with no clash. Not a tautology. (3) F under main ⊃: p ⊃ q T; ~q ⊃ ~p F, so ~q T (q F) and ~p F (p T); then p ⊃ q = T ⊃ F is F, a clash. Tautology. (4) F under ∨: q ⊃ p F gives q T, p F; p • q = F • T = F, so no clash. Not a tautology. (5) F under ∨: ~p F gives p T; p • p F needs p F, a clash. Tautology. (6) F under ∨: ~q F gives q T; q ⊃ ~p F gives ~p F, so p T; no clash. Not a tautology. (7) Main • false: take p T, q T: ~p ⊃ q is T and ~p • ~q is F, so T • F = F with no clash. Not a tautology (in fact a contradiction, because ~p • ~q makes ~p ⊃ q false). (8) F under ⊃: ~p F gives p T; (~p ∨ ~q) • q T gives q T and ~p ∨ ~q T, but F ∨ F is F, a clash. Tautology.
5. Q.5 (9–17): (9) (p ⊃ ~q) ∨ (~q ⊃ p) (10) ~p ∨ (p ⊃ q) (11) (p ⊃ q) ≡ (~p ∨ q) (12) (~p • ~q) ⊃ (q ⊃ ~p) (13) (p ∨ q) ⊃ ~(p • q) (14) ~(p ∨ q) ≡ (~p • ~q) (15) (~p • q) ⊃ (q ⊃ p) (16) (q ⊃ p) • ~p (17) ~(p • q) ∨ (p ⊃ ~q)
Answer: (9) F under ∨: p ⊃ ~q F gives p T and q T; ~q ⊃ p F needs p F, a clash. Tautology. (10) F under ∨: ~p F gives p T; p ⊃ q F gives q F; no clash. Not a tautology. (11) Case 1: p ⊃ q T and ~p ∨ q F, so p T and q F, but then p ⊃ q is F, a clash. Case 2: p ⊃ q F (p T, q F) and ~p ∨ q T, but F ∨ F is F, a clash. Tautology. (12) F under ⊃: ~p • ~q T gives p F and q F; q ⊃ ~p F needs q T, a clash. Tautology. (13) F under ⊃: ~(p • q) F gives p T and q T; p ∨ q is T; no clash. Not a tautology. (14) Case 1: ~(p ∨ q) T gives p F and q F, but then ~p • ~q is T, not F, a clash. Case 2: ~(p ∨ q) F needs p or q to be T, while ~p • ~q T needs both F, a clash. Tautology (De Morgan's law). (15) F under ⊃: q ⊃ p F gives q T, p F; ~p • q is T; no clash. Not a tautology. (16) Main • false: take p T, q T: q ⊃ p is T and ~p is F, so the line reads F with no clash. Not a tautology. (17) F under ∨: ~(p • q) F gives p T and q T; p ⊃ ~q is F; no clash. Not a tautology.
6. Q.5 (18–25): (18) (~p ⊃ q) • (~q ⊃ p) (19) p ⊃ [(r ⊃ p) ⊃ p] (20) p ⊃ (p ∨ q) (21) (p ∨ p) ≡ ~p (22) ~(p ⊃ ~q) ⊃ (q • p) (23) p • ~(p ⊃ ~p) (24) ~[p ⊃ (~q ∨ p)] (25) (p • q) ≡ (~p ⊃ ~q)
Answer: (18) Main • false. T • F: ~q ⊃ p F gives q F, p F, but then ~p ⊃ q is F, not T, a clash. F • T: ~p ⊃ q F gives p F, q F, but then ~q ⊃ p is F, a clash. F • F: p F, q F makes both conjuncts F with no clash. Not a tautology. (19) F under the first ⊃: p T; (r ⊃ p) ⊃ p F needs p F, a clash. Tautology. (20) F under ⊃: p T and p ∨ q F needs p F, a clash. Tautology. (21) Case 1: p ∨ p T (p T) and ~p F (p T): no clash. Not a tautology (a full table shows it is a contradiction). (22) F under ⊃: q • p F; ~(p ⊃ ~q) T gives p ⊃ ~q F, so p T and q T, and then q • p is T, a clash. Tautology. (23) Main • false. T • F: p T makes p ⊃ ~p F, so ~(p ⊃ ~p) is T, not F, a clash. F • T: p F makes ~(p ⊃ ~p) F, a clash. F • F: p F makes both conjuncts F with no clash. Not a tautology. (24) F under the outer ~: p ⊃ (~q ∨ p) is T; take p T, q T: no clash. Not a tautology (it is a contradiction, since the bracket is a tautology). (25) Case 1: p • q T and ~p ⊃ ~q F needs p F, a clash. Case 2: p • q F and ~p ⊃ ~q T; take p T, q F: no clash. Not a tautology.
7. 'Assign the correct truth value' box: (1) (p ⊃ q) ⊃ [(p ⊃ r) ⊃ q] with F under the main ⊃ (2) ~[(~p ∨ q) • (~q • r)] with F under ~.
Answer: (1) The antecedent p ⊃ q gets T and the bracket's ⊃ gets F. Continuing: p ⊃ r T, q F; with p F, r T there is no clash, so this form is not a tautology. (2) A false ~ makes the bracket's • true, so ~p ∨ q is T and ~q • r is T (q F, r T); then ~p must be T (p F). No clash, so it is not a tautology.
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. The shorter truth table is based on the principle of…
Answer: B. Assume the opposite and show it leads to an absurdity.
2. The first step is to write F under the…
Answer: A. We assume the whole form is false.
3. Inconsistency in the shorter truth table proves the form is…
Answer: B. The assumption 'false' is impossible.
4. A false implication means…
Answer: D. ⊃ is false only in the T, F case.
5. A false disjunction means…
Answer: B. ∨ is false only when both parts are false.
6. How many possibilities must be tested for a false conjunction?
Answer: A. T•F, F•T and F•F.
7. How many possibilities for a false equivalence?
Answer: C. T≡F and F≡T.
8. The shorter truth table is called an indirect method because…
Answer: C. It shows the form cannot be false.
9. Which is NOT a type of inconsistency?
Answer: B. A single F is not a clash.
10. (p ⊃ q) ⊃ (~q ⊃ ~p) is…
Answer: B. Assuming it false forces q F and p T, but p ⊃ q must be T, a clash.
11. (q ⊃ p) • ~p is…
Answer: C. With p T and q T the whole form is F without any clash.
12. A full truth table for 4 variables has…
Answer: A. 2⁴ = 16.
13. If both antecedent and consequent are false, the implication is…
Answer: C. Only T ⊃ F is false.
14. When we deny a tautology we get a…
Answer: C. Every T becomes F.
15. If one of several possibilities shows no clash, the form is…
Answer: D. One false row is enough.
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 45 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.