Syllogism is the most rule-bound topic in SSC GD Reasoning. Once you learn the rules, it becomes mechanical — no intuition needed, just a process. That's good news for you in the exam hall.
Here's the core idea: you are given two or three statements about categories of objects (boxes, trees, horses, flowers — it doesn't matter what they are). Each statement uses one of four relationships: All, Some, No/None, or Some...not. Your job is to decide which conclusions can be logically guaranteed to follow from those statements.
The trap most candidates fall into is reading with common sense. You see "All flowers are buses" and your brain rebels — flowers are not buses. Ignore that. In syllogism, the statements are true by definition, no matter how absurd they sound. Your only job is to check logical consistency.
Think of it like this: imagine each category as a circle on paper (a Venn diagram). The statements tell you how those circles overlap or sit inside each other. A conclusion follows only if it must be true in every possible drawing that satisfies all the statements — not just one drawing, but all of them.
The four statement types, in plain language:
The analogy that works best: think of these as a game of rings on a flat table. "All" means one ring is fully inside another. "Some" means two rings partially overlap. "No" means two rings don't touch at all. "Some...not" means at least one element of a ring is outside the other.
A conclusion is valid only when it holds true for every possible ring arrangement that fits the given statements.
This is the foundation. You must memorize which statements can be "converted" (their subject and predicate swapped) and what comes out:
| Original Statement | Converted Form | Valid? | |----|----|----| | All A are B | Some B are A | Yes — valid conversion | | Some A are B | Some B are A | Yes — valid conversion | | No A is B | No B is A | Yes — valid conversion | | Some A are not B | Some B are not A | No — invalid conversion |
Look — "All A are B" does NOT convert to "All B are A". That is the single most common wrong conclusion in SSC GD papers. If all cats are animals, it doesn't mean all animals are cats. But some animals are definitely cats. That's the valid conversion.
A direct conclusion follows from a single statement after conversion. A derived conclusion requires combining two statements using a chain rule.
Chain Rules (Mediate Conclusions):
These rules tell you what you can conclude when you chain two statements together. The middle term (the category that appears in both statements) must connect them.
Rule 1: All + All = All All A are B. All B are C. → All A are C.
Rule 2: All + Some = No definite conclusion All A are B. Some B are C. → You cannot conclude anything about A and C. (The "Some B" might be the B's that are also A, or they might not be — you can't tell.)
Rule 3: Some + All = Some Some A are B. All B are C. → Some A are C. This one holds. Why? Because the "some A" that are B must follow B into C.
Rule 4: Some + Some = No definite conclusion Some A are B. Some B are C. → Nothing certain about A and C.
Rule 5: No + All = No (reversed) No A is B. All C are B. → No C is A (equivalently, No A is C).
Rule 6: No + Some = Some...not No A is B. Some C are B. → Some C are not A.
Rule 7: All + No = No All A are B. No B is C. → No A is C.
This is the rule that trips up the most people and generates the most "either I or IV" type answers.
A complementary pair exists between two conclusions when:
The classic complementary pairs are:
When the question asks "either I or IV follows," it means: we can't definitively prove I, and we can't definitively prove IV, but together they form a complementary pair so one of them must be true.
Critical condition for Either-Or: Both conclusions must be about the same subject-predicate pair. "Some fruits are boxes" and "No fruits are boxes" form a complementary pair. "Some fruits are boxes" and "No fruits are trees" do not.
For SSC GD, drawing full Venn diagrams for every question is too slow. Use them only when the statements are unclear or when you need to check a tricky boundary case. For straightforward chains, use the rules above directly.
When you do draw: draw the most restrictive diagram first (the one where circles overlap as little as possible), then draw the most expansive one (maximum overlap). If a conclusion holds in both extremes, it follows. If it fails in even one, it doesn't follow (unless it's part of a complementary pair).
Map statement combinations to their outputs using one mnemonic row:
Standard method: recall each rule from scratch — 6 lookups per question. With this table memorized: 1 lookup per chain. Cuts chain-checking from ~40s to ~15s per question.
Remember which conversions are valid: A → S, S → S, N → N, SN → invalid.
When you see a conclusion that looks like a conversion, check: is the original statement the right type? For example, "All flowers are buses" → "Some buses are flowers" is valid (A→S). But "Some buses are flowers" → "All flowers are buses" is invalid (S cannot become A). Standard recall: 30s of thinking. With ASON: 5s.
Before applying the complementary pair rule, run a 3-step fingerprint test:
If yes to all three — mark "either-or". If no to any one — don't mark either-or, mark both as not following.
This eliminates the false either-or trap (e.g., "Some A are B" and "No B are C" — different predicates, not a complementary pair). Standard approach: visual re-reading — 25s per pair. With fingerprint test: 8s.
Work through conclusions in order of confidence: first check all "All" conclusions (hardest to prove, eliminate quickly), then "No" conclusions (check if No-chain is complete), then "Some" conclusions (easiest to confirm), then check leftover pairs for either-or.
By eliminating strong conclusions first, you narrow the answer options rapidly. In a 4-conclusion question, this can reduce your active checks from 4 to 2 in most cases. Step count: standard approach 4 checks per question, drain method average 2.5 checks per question.
Before applying any chain rule, identify the middle term (the term that appears in both statements you're chaining). If the middle term is the predicate of the first statement AND the subject of the second statement — the chain is clean. If the middle term appears in the same position in both statements (both as predicate, or both as subject), you need to convert one statement first before chaining.
Example: "Some boxes are trees. Some trees are horses." → Middle term = trees (predicate of S1, subject of S2). Clean chain. "Some boxes are trees. Some horses are trees." → Middle term = trees (predicate of both). Must convert S2 to "Some trees are horses" first, then chain. Missing this costs 1 wrong answer. Catching it takes 5 extra seconds and saves the mark.
In the exam hall, follow this sequence for every syllogism question:
Step 1 — Label statements (10 seconds). Mark each statement as A (All), S (Some), N (No), or SN (Some...not).
Step 2 — Identify valid chains (15 seconds). Find which pairs of statements share a middle term. Note the middle term and apply the chain table (A+A=A, S+A=S, A+N=N, N+S=SN, anything with S+S or A+S = nothing certain).
Step 3 — Check each conclusion (20 seconds each). For each conclusion, ask: is this a direct conversion of a given statement, or a chain result? Apply the ASON conversion rule or chain result accordingly.
Step 4 — Scan for either-or (10 seconds). Look at the conclusions that didn't follow definitively. Run the fingerprint test on pairs. If two failed conclusions form a complementary pair, mark either-or.
Decision rule for "None follows" vs. "Either-or follows": If you can't prove any conclusion AND no complementary pair exists — it's "None follows." If you can't prove specific conclusions but a complementary pair exists — it's "either...or follows."
Total time target per question: 60-75 seconds.
Why this question: Tests the either-or rule directly, plus a clean Some+All chain.
Solving path:
Why this question: Tests All+Some chain (which gives nothing) vs. Some+All chain (which gives Some).
Solving path:
Why this question: Tests All+No chain and the reverse: does the negative propagate both ways?
Solving path:
Why this question: Tests whether "All dogs are chairs" truly follows and whether III is a trap (S+S chain).
Solving path:
Why this question: Tests a No+No chain and whether "Some men are roads" creates a direct connection.
Solving path:
Treating "All A are B" as reversible to "All B are A." This is the most-penalized mistake in SSC GD syllogism. All fans are rooms does NOT mean all rooms are fans. The correct conversion is "Some rooms are fans."
Ignoring the middle-term position before chaining. If the middle term is the predicate in both statements, you must convert one before chaining. Skipping this step generates phantom conclusions.
Applying either-or to non-complementary pairs. Two conclusions form an either-or only if they share the same subject AND predicate and are a Some/No or All/Some-not pair. Checking just one condition leads to false either-or marks.
Treating "Some...not" as convertible. "Some A are not B" cannot be converted to "Some B are not A." This conversion is invalid. When you see a conclusion that looks like a converted Some...not, reject it immediately.
Using real-world knowledge. "No man is sky" feels absurd — but you must accept it as true and work purely from the logical relationships. Students who try to apply common sense in syllogism lose marks on exactly these abstract questions.
Marking "None follows" when an either-or pair exists. After finding that definite conclusions don't follow, always scan the remaining conclusions for complementary pairs before defaulting to "None follows."