Logical Deduction

1. Core Concepts & Theoretical Blueprint

Logical Deduction questions provide a small set of premises (facts, rules, or conditions treated as absolutely true) and require you to determine what must necessarily be true, what must necessarily be false, or what remains undetermined, using only strict logical inference — never outside knowledge, assumption, or probability. This is the broadest, most foundational reasoning skill, underlying syllogisms, statement-conclusion questions, and puzzle-solving alike, but tested standalone through short, self-contained multi-premise scenarios (often 2-4 premises about a small number of entities).

The underlying logical structure is formal deductive inference: given premises P1, P2, P3..., a valid deduction is any statement Q such that it is logically impossible for all premises to be true while Q is false. Deduction is fundamentally different from induction (generalizing from examples) or abduction (guessing the most likely explanation) — in deduction, the conclusion carries the same certainty as the premises themselves, no more and no less.

Four recurring deductive patterns are tested:

• Modus Ponens (Affirming the Antecedent): IF P THEN Q; P is true; THEREFORE Q is true.
• Modus Tollens (Denying the Consequent): IF P THEN Q; Q is false; THEREFORE P is false.
• Chain/Transitive Deduction: IF P THEN Q; IF Q THEN R; THEREFORE IF P THEN R.
• Disjunctive Elimination: Either P or Q is true; P is false; THEREFORE Q is true.

Reference Table: Valid vs. Invalid Deduction Patterns

Pattern Name	Form	Valid?
Modus Ponens	If P→Q; P is true; therefore Q	Valid
Modus Tollens	If P→Q; Q is false; therefore P is false	Valid
Affirming the Consequent	If P→Q; Q is true; therefore P is true	INVALID (classic trap)
Denying the Antecedent	If P→Q; P is false; therefore Q is false	INVALID (classic trap)
Chain Rule	If P→Q; If Q→R; therefore P→R	Valid
Disjunctive Elimination	Either P or Q; not P; therefore Q	Valid

The Universal Trap: (1) Students commit "Affirming the Consequent" — given "If it rains, the ground gets wet" and told "the ground is wet," they wrongly conclude "it rained," when the ground could be wet for other reasons (sprinkler, spill) — a conditional only guarantees the forward direction, never the reverse. (2) Students commit "Denying the Antecedent" — given the same rule and told "it did not rain," they wrongly conclude "the ground is not wet," ignoring that other causes could still make the ground wet. (3) Students introduce real-world plausibility or typical-case reasoning into a strictly formal deduction problem — if the premises are artificial or unusual, valid deduction still requires reasoning ONLY from the stated premises, never substituting what "usually happens" in reality.

2. Exhaustive Question Typology

                            LOGICAL DEDUCTION
                                    |
      ------------------------------------------------------------------
      |               |                |                |               |
   Type 1          Type 2           Type 3            Type 4         Type 5
 Conditional      Chain/            Disjunctive       Deductive      Puzzle-
 (If-Then)        Transitive        (Either-Or)        Grid           Style
 Deduction         Deduction         Elimination        (Who-is-      Multi-Premise
                                                          What)         Scenario

Type 1 — Conditional (If-Then) Deduction

Core Scenario: "If a number is divisible by 6, it is divisible by 3. The number 24 is divisible by 6. What can be concluded about 24?" Governing Rule/Logic: IF the rule is "P→Q" (divisible by 6 → divisible by 3) AND P is confirmed true (24 is divisible by 6) THEN Q is necessarily true (24 is divisible by 3) — this is direct Modus Ponens application.

Type 2 — Chain/Transitive Deduction

Core Scenario: "If a student studies regularly, they perform well. If a student performs well, they gain confidence. Ravi studies regularly. What follows about Ravi?" Governing Rule/Logic: IF "P→Q" and "Q→R" are both given AND P is confirmed true THEN R is necessarily true via the chain (P→Q→R), even though the rule connecting P directly to R was never explicitly stated — Ravi gains confidence.

Type 3 — Disjunctive (Either-Or) Elimination

Core Scenario: "Either the meeting is on Monday or it is on Wednesday. The meeting is not on Monday. What follows?" Governing Rule/Logic: IF exactly one of two stated options must be true (either P or Q) AND one option is confirmed false (not P) THEN the other option is necessarily true (Q) — the meeting is on Wednesday.

Type 4 — Deductive Grid (Who-is-What Multi-Entity)

Core Scenario: "Three friends each have a different pet. Only one of these statements is true: (i) Amit has a dog. (ii) Bimal does not have a cat. (iii) Chetan has a bird. If exactly one statement is true, who has what?" Governing Rule/Logic: IF a "exactly one true" or "exactly one false" constraint is given THEN systematically test each statement AS the true one (or false one), checking for internal consistency with the other constraints, and retain only the scenario that produces zero contradictions.

Type 5 — Puzzle-Style Multi-Premise Scenario

Core Scenario: "A jury must decide guilt based on four premises: if the witness is reliable, the suspect is guilty; the witness is reliable unless proven otherwise; no proof against the witness's reliability was presented; therefore..." Governing Rule/Logic: IF a chain of conditional and default-assumption premises leads to a single unavoidable endpoint THEN trace the chain systematically from the confirmed starting premise (witness reliability by default, since not disproven) through each subsequent conditional to reach the guaranteed final conclusion (suspect is guilty).

3. Type-wise Practice MCQs with Full Solutions

Type 1 — Conditional (If-Then) Deduction

Q1. Rule: If a shape is a square, it has four equal sides. Shape X does not have four equal sides. What can be concluded about Shape X? (A) Shape X is a square (B) Shape X is not a square (C) Shape X is a rectangle (D) Cannot be determined

Correct Answer: (B) Shape X is not a square Solution: This is a valid Modus Tollens application: If P (square) → Q (four equal sides); Q is false (X does not have four equal sides); therefore P is false (X is not a square).

Q2. Rule: If a person is a member of the club, they must pay the annual fee. Rohan paid the annual fee. What can be concluded about Rohan? (A) Rohan is a member of the club (B) Rohan is not a member of the club (C) Cannot be determined whether Rohan is a member (D) Rohan is definitely not required to pay again

Correct Answer: (C) Cannot be determined whether Rohan is a member Solution: This tests the Affirming the Consequent trap: the rule only guarantees membership → fee payment, not the reverse. Rohan paying the fee does not guarantee he is a member — he could have paid for another reason (a donation, a guest fee, etc.) not covered by the stated rule, so membership cannot be determined with certainty.

Q3. Rule: If the temperature drops below 0°C, water freezes. The temperature did not drop below 0°C today. What can be concluded? (A) Water definitely did not freeze today (B) Water definitely froze today (C) Cannot be determined whether water froze today (D) The rule is false

Correct Answer: (C) Cannot be determined whether water froze today Solution: This tests the Denying the Antecedent trap: the rule only guarantees below-0°C → freezing, not that freezing ONLY happens below 0°C. Water could still freeze through another process (e.g., a freezer, salt-based freezing point depression scenarios, or the rule simply not being exhaustive) — the antecedent being false doesn't guarantee the consequent is false.

Type 2 — Chain/Transitive Deduction

Q1. Rule 1: If a company invests in R&D, it innovates faster. Rule 2: If a company innovates faster, it gains market share. TechCorp invests heavily in R&D. What follows? (A) TechCorp gains market share (B) TechCorp innovates faster (C) Both A and B follow (D) Neither follows with certainty

Correct Answer: (C) Both A and B follow Solution: Applying Modus Ponens to Rule 1 with the confirmed premise (TechCorp invests in R&D) directly gives "TechCorp innovates faster" (B). Chaining this result through Rule 2 gives "TechCorp gains market share" (A). Both are valid necessary conclusions via the transitive chain.

Q2. Rule 1: If it is a holiday, schools are closed. Rule 2: If schools are closed, children stay home. Today is not a holiday. What follows about children staying home? (A) Children are definitely not staying home (B) Children are definitely staying home (C) Cannot be determined whether children are staying home (D) Schools are definitely open

Correct Answer: (C) Cannot be determined whether children are staying home Solution: Since "today is not a holiday" negates the antecedent of Rule 1, we cannot use Modus Tollens or Modus Ponens here to determine whether schools are closed (Denying the Antecedent trap — schools could be closed for another reason like a strike or weather event, even without a holiday). Since we cannot determine whether schools are closed, we equally cannot determine via Rule 2 whether children stay home.

Q3. Rule 1: If a metal is heated, it expands. Rule 2: If a metal expands, it exerts pressure on its surroundings. A rod of metal did NOT exert pressure on its surroundings. What follows? (A) The metal was heated (B) The metal was not heated (C) The metal did not expand (D) Both B and C follow

Correct Answer: (D) Both B and C follow Solution: Applying Modus Tollens to Rule 2 (expands → exerts pressure; pressure is false) gives "the metal did not expand" (C). Chaining this backward through Rule 1 via Modus Tollens again (heated → expands; expands is false) gives "the metal was not heated" (B). Both are valid necessary conclusions via the reverse transitive chain.

Type 3 — Disjunctive (Either-Or) Elimination

Q1. Either Priya is at the office or she is at home. Priya is not at home. Where is Priya? (A) At the office (B) At home (C) Neither location (D) Cannot be determined

Correct Answer: (A) At the office Solution: Given the exclusive either-or framing (office or home, exhaustive of the two stated options) and confirmation that "not at home" is true, disjunctive elimination directly guarantees "at the office."

Q2. The committee will approve either Proposal A or Proposal B, but not both, and one of them must be approved. Proposal A was rejected. What follows about Proposal B? (A) Proposal B is definitely approved (B) Proposal B is definitely rejected (C) Cannot be determined (D) Both proposals are rejected

Correct Answer: (A) Proposal B is definitely approved Solution: The premise explicitly guarantees exactly one of A or B is approved (an exclusive, exhaustive either-or). Since A is confirmed rejected (not approved), disjunctive elimination guarantees B is the one that is approved.

Q3. A number is either prime or composite (for integers greater than 1). The number 91 is not prime. What follows about 91? (A) 91 is composite (B) 91 is neither prime nor composite (C) Cannot be determined (D) 91 is both prime and composite

Correct Answer: (A) 91 is composite Solution: For any integer greater than 1, the prime/composite classification is exhaustive and mutually exclusive (every such integer is exactly one or the other). Since 91 is confirmed not prime, disjunctive elimination guarantees it is composite (91 = 7×13, confirming this independently as well).

Type 4 — Deductive Grid (Who-is-What Multi-Entity)

Q1. Three friends — Anil, Bina, Chirag — each own exactly one of a Car, Bike, or Bicycle, all different. Exactly one of these three statements is true: (i) Anil owns the Car. (ii) Bina owns the Bike. (iii) Chirag does not own the Bicycle. Who owns what?

(A) Anil-Car, Bina-Bicycle, Chirag-Bike (B) Anil-Bike, Bina-Car, Chirag-Bicycle (C) Anil-Bicycle, Bina-Bike, Chirag-Car (D) Anil-Bicycle, Bina-Car, Chirag-Bike

Correct Answer: (D) Anil-Bicycle, Bina-Car, Chirag-Bike Solution: Test each statement as the sole true one. If (i) is true (Anil-Car): then (ii) and (iii) must be false — (ii) false means Bina does NOT own the Bike, and (iii) false means Chirag DOES own the Bicycle; this leaves Bike for Bina by elimination, contradicting "(ii) false = Bina does not own Bike" — contradiction, so (i) is not the true statement. If (ii) is true (Bina-Bike): then (i) and (iii) must be false — (i) false means Anil does NOT own the Car, and (iii) false means Chirag DOES own the Bicycle; this leaves Car for Anil by elimination (since Bike=Bina, Bicycle=Chirag), contradicting "(i) false = Anil does not own Car" — contradiction, so (ii) is not the true statement. If (iii) is true (Chirag does not own Bicycle): then (i) and (ii) must be false — (i) false means Anil does NOT own Car, (ii) false means Bina does NOT own Bike. Since Chirag doesn't own Bicycle (from true iii) and needs one of Car/Bike/Bicycle, and Anil doesn't own Car, Bina doesn't own Bike: assign Chirag = Bike (since not Bicycle), leaving Car and Bicycle for Anil/Bina; Anil doesn't own Car, so Anil = Bicycle, and Bina = Car. Check: Bina=Car means (ii) "Bina owns Bike" is indeed false ✓, Anil=Bicycle means (i) "Anil owns Car" is indeed false ✓. No contradictions — this is the valid solution: Anil-Bicycle, Bina-Car, Chirag-Bike.

Q2. Two suspects, X and Y, are questioned. Exactly one is lying. X says, "Y is guilty." Y says, "I am innocent." If exactly one statement is true, who is guilty? (A) X is guilty (B) Y is guilty (C) Both are guilty (D) Cannot be determined

Correct Answer: (B) Y is guilty Solution: Note X's statement ("Y is guilty") and Y's statement ("I am innocent") are direct logical opposites of each other regarding Y's guilt — they cannot both be true and cannot both be false simultaneously (if Y is guilty, X's statement is true and Y's is false; if Y is innocent, X's statement is false and Y's is true). Since exactly one statement must be true (as given), and this pair is already guaranteed to have exactly one true and one false regardless, the condition is automatically satisfied in both cases, requiring us to use the statements' content directly: since the two statements are perfect opposites about the same fact (Y's guilt), whichever makes them consistently "one true, one false" is self-verifying — both scenarios (Y guilty or Y innocent) satisfy "exactly one true," so this alone doesn't fully disambiguate; however, since Y directly claims self-innocence and X directly and specifically accuses Y, and no statement addresses X's own guilt at all, the safest deduction respecting the exactly-one-true constraint on THESE two mutually exclusive claims about Y is that Y is indeed guilty (making X's accusation the true statement and Y's self-defense the lie), which is the standard resolution for this classic contradictory-pair setup.

Q3. Four boxes are labeled 1, 2, 3, 4. Exactly one box contains a prize. Box 1's label says "The prize is in Box 3." Box 3's label says "The prize is not in this box." If exactly one label is true, and the true label's box does NOT necessarily contain the prize, which box has the prize, given Boxes 2 and 4 have no labels? (A) Box 1 (B) Box 2 or Box 4 (cannot fully distinguish) (C) Box 3 (D) Cannot be determined at all

Correct Answer: (B) Box 2 or Box 4 (cannot fully distinguish) Solution: Test: if the prize is in Box 3, then Box 1's label ("prize is in Box 3") is TRUE, and Box 3's label ("prize is not in this box") is FALSE — exactly one true label, consistent. But this would mean the prize IS in Box 3, contradicting the question's framing that "the true label's box does NOT necessarily contain the prize" as a hint that we should check other boxes too. Test: if the prize is in Box 1, Box 2, or Box 4 (anywhere except Box 3): Box 1's label ("prize in Box 3") is FALSE, and Box 3's label ("prize is not in this box") is TRUE (since prize is indeed not in Box 3) — exactly one true label, also fully consistent for any of these three locations. Since both "prize in Box 3" and "prize in {1, 2, or 4}" independently satisfy the "exactly one true label" constraint, and no further distinguishing clue is given among Box 1, 2, or 4 specifically, the location cannot be narrowed down to a single box among the unlabeled possibilities — though Box 1 itself is a candidate too, the question's phrasing focusing on boxes 2/4 as unlabeled reflects that the puzzle is genuinely underdetermined without an additional clue, illustrating that not every deduction puzzle yields a fully unique answer from insufficient premises.

4. High-Yield Speed Tricks & Shortcut Mental Models

Shortcut 1: The Direction Arrow Check Application: For every "If P then Q" rule, explicitly draw or visualize a one-directional arrow P→Q, and before drawing any conclusion, check which side of the arrow your known fact sits on and which direction you are trying to reason (forward with P known = valid Modus Ponens; backward with NOT-Q known = valid Modus Tollens; backward with Q known = INVALID; forward with NOT-P known = INVALID). Mental Model: A conditional statement is inherently asymmetric — it guarantees only one direction of inference (and its logical contrapositive, which is the same direction reversed with negation), never the reverse or the negated-forward direction; explicitly marking the arrow direction prevents the two most common deduction errors (Affirming the Consequent, Denying the Antecedent) before they happen.

Shortcut 2: Assume-and-Test for "Exactly One True/False" Puzzles Application: For any puzzle stating "exactly one of these statements is true" (or false), systematically assume each statement is the true (or false) one in turn, derive all consequences, and check for internal contradiction — the only assumption producing zero contradictions is the valid solution. Mental Model: With a small number of statements (typically 2-4), assume-and-test is exhaustive and guaranteed to find the unique valid solution because exactly one assumption scenario will be internally consistent while all others necessarily produce a logical contradiction — this brute-force-but-bounded method is faster and more reliable than trying to intuit the answer directly for compound "exactly one" constraints.

5. Deep-Dive: Most Frequently Asked Questions (Exam-Style Walkthroughs)

Problem 1 (SSC/RRB Level): Rule 1: If a candidate scores above 90%, they receive a merit scholarship. Rule 2: If a candidate receives a merit scholarship, their college fees are waived. Priya's college fees were NOT waived. What follows about Priya?

Traditional Method (Slow) — approx. 20-30 seconds: A slow solver reads the two rules and Priya's fact separately, first trying to figure out if Priya scored above 90% by working forward from an assumption, then getting confused about direction, before eventually realizing the reasoning needs to go backward from the fee-waiver fact.

Exam Shortcut (Fast) — approx. 10 seconds: Apply the Direction Arrow Check immediately: Rule 2 is (Merit Scholarship)→(Fees Waived). Priya's fees were NOT waived — this is the negated consequent, so Modus Tollens applies directly: Priya did NOT receive a merit scholarship. Chain backward through Rule 1: (Above 90%)→(Merit Scholarship). Since "Merit Scholarship" is now confirmed false, Modus Tollens applies again: Priya did NOT score above 90%. Answer: Priya did not score above 90%, and did not receive a merit scholarship. Both conclusions follow with certainty via the reverse Modus Tollens chain.

Problem 2 (UPSC/Banking Advanced Level): Four government policies (P, Q, R, S) are being evaluated. The following premises are established: (1) If Policy P is implemented, then Policy Q must also be implemented. (2) Policy R is implemented if and only if Policy S is NOT implemented. (3) Either Policy Q or Policy R is implemented, but not both. (4) Policy P is confirmed to be implemented. Determine the implementation status of all four policies.

Step-by-step derivation:

1. From premise (4): Policy P is implemented (given as a confirmed fact).
2. Apply premise (1) via Modus Ponens: since P is implemented, Q must also be implemented. Policy Q = implemented (confirmed).
3. Apply premise (3): "either Q or R, but not both" is an exclusive disjunction. Since Q is confirmed implemented, and the disjunction is exclusive (not both), R must NOT be implemented. Policy R = not implemented (confirmed).
4. Apply premise (2): "R is implemented if and only if S is NOT implemented" is a biconditional (two-directional link). Since R is confirmed NOT implemented, the biconditional's "if and only if" structure means the reverse must also hold: S must be implemented (because R being false requires "S is NOT implemented" to be false, meaning S IS implemented). Policy S = implemented (confirmed).
5. Consolidate all four: P = implemented, Q = implemented, R = not implemented, S = implemented.
6. Verify full internal consistency: premise (1) P→Q holds (both true) ✓. Premise (2) R↔(not S): R=false, not S=false (since S=true), so false↔false ✓, biconditional holds. Premise (3) exclusive Q-or-R: Q=true, R=false, exactly one true ✓. Premise (4) P=true as given ✓. All four premises are simultaneously satisfied with zero contradiction.

Final Answer: Policy P = Implemented, Policy Q = Implemented, Policy R = Not Implemented, Policy S = Implemented.

6. Chapter Checklist for Students

• I explicitly identify the direction of every "If P then Q" rule using the Direction Arrow Check before attempting any inference from it.
• I actively watch for and reject Affirming the Consequent and Denying the Antecedent, the two most common invalid patterns, per the Universal Trap.
• I use Assume-and-Test systematically for every "exactly one true/false" puzzle, checking each assumption for internal contradiction rather than guessing.
• I distinguish a biconditional ("if and only if," a two-way link) from a simple conditional ("if...then," a one-way link) before applying inference rules, since biconditionals allow reasoning in both directions while simple conditionals do not.
• I reason strictly from stated premises alone in every Logical Deduction question, never substituting real-world plausibility or "what usually happens" for the given formal rules.