Module 2 · RRB Station Master General Intelligence and Reasoning

Syllogism

Updated 17 Nov 2026 · 5,741 words
Updated 21 Nov 2026
Venn diagrams and the possibility conclusions the paper asks.
Two premises · three premises · possibility cases · either-or

Learning Objectives

  • Understand the fundamental concepts of Syllogism
  • Apply key formulas and techniques to solve problems
  • Practice with exam-level questions to build speed and accuracy

What is Syllogism?

Syllogism is a logical reasoning topic where you are given two or more statements (premises) and you must determine which conclusions follow logically from them. Each statement involves relationships between categories using words like 'All', 'No', 'Some', and 'Some Not'. The exam typically asks 2-3 syllogism questions in Tier 1.

Types of Statements

1. Universal Affirmative (All A are B): Every member of category A belongs to category B. Venn diagram: circle A inside circle B.

2. Universal Negative (No A is B): No member of A belongs to B. Venn diagram: two non-overlapping circles.

3. Particular Affirmative (Some A are B): At least one member of A belongs to B. Venn diagram: overlapping circles.

4. Particular Negative (Some A are not B): At least one member of A does not belong to B. Venn diagram: part of A outside B.

The Venn Diagram Method

Draw overlapping circles for each category mentioned. For each statement, shade or mark regions that are definitely occupied or empty. A conclusion follows if it is true in ALL possible Venn diagrams that satisfy the given statements. If you can draw one valid diagram where the conclusion is false, the conclusion does not follow.

Solved Examples

Example 1 (Basic)
Statements:
1. All pens are books.
2. No book is a table.

Conclusions:
I. No pen is a table.
II. Some books are pens.

Which conclusion(s) follow(s)?
Solution: Both I and II follow. From the statements: All pens are inside the set of books. No book is a table, so pens (being inside books) cannot be tables either → Conclusion I follows. Conclusion II (Some books are pens) is also true since all pens are books, which implies at least some books are pens.
Example 2 (Either-Or Case)
Statements:
1. Some apples are mangoes.
2. No mango is a banana.

Conclusions:
I. Some apples are not bananas.
II. Some bananas are not apples.

Which conclusion(s) follow(s)?
Solution: Only I follows. From statements: some apples are mangoes, and no mango is banana. So those apples which are mangoes cannot be bananas → Conclusion I follows. However, we cannot say anything definitive about bananas that are not apples — there might be some or none. So II does not follow.
Example 3 (Complementary Pair)
Statements:
1. All cats are animals.
2. Some animals are not dogs.

Conclusions:
I. Some cats are dogs.
II. No cat is a dog.

Which conclusion(s) follow(s)?
Solution: Neither I nor II follows individually. But I and II form a complementary pair (Some vs No — one affirmative, one negative covering all possibilities). In such cases, 'Either I or II follows' would be the correct answer if both options are available. Here, since we are just checking individually, neither is definitely true.

Shortcut Techniques

  • Use the rules of syllogism: If all A are B and all B are C, then all A are C. If no A is B and all C are A, then no C is B.
  • For 'Some' statements: at least one element of the subject belongs to the predicate.
  • Remember: 'All A are B' does NOT mean 'All B are A' — reverse is not always true.
  • In SSC, the either-or case occurs when two conclusions are complementary — one positive, one negative, covering all possibilities.
Pro Tip
Always draw at least two possible Venn diagrams if you're unsure. A conclusion follows ONLY if it is true in ALL possible diagrams. If one diagram shows it false, the conclusion does not follow.

Advanced Problem Types

Competitive exams feature advanced variations combining multiple reasoning concepts. Master these to score high.

Multi-Step Problems

Some questions require applying multiple reasoning techniques sequentially. Break problems into clear steps.

Common Traps

  • Assuming a pattern continues without checking all elements
  • Misinterpreting negative statements in syllogisms
  • Forgetting wrapping in alphabet coding (Z to A transition)
  • Confusing directions (East vs West)
  • Overlooking either-or cases in syllogisms
  • Not considering all possible arrangements in puzzles
Pro Tip
For puzzles, start with the most concrete clue and build around it. Draw diagrams for seating arrangements and family trees for blood relations.

Definite vs Possible Conclusions in Syllogism

In every syllogism the examiner distinguishes between conclusions that are definitely true in all admissible Venn diagrams and those that are merely possible in at least one diagram. A definite conclusion follows when the logical structure forces the relationship regardless of how the non‑specified elements are arranged. A possible conclusion, by contrast, holds in some arrangements but fails in others; therefore it cannot be selected as a valid inference unless the question explicitly asks for “which of the following may be true”. The key to separating the two lies in drawing the minimum and maximum overlap diagrams for each premise set. The minimum diagram places the subject and predicate circles as far apart as the premises allow; the maximum diagram merges them as much as the premises permit. If a conclusion appears in both extremes, it is definite. If it appears only in the maximum (or only in the minimum) it is merely possible. This two‑diagram test eliminates the common error of assuming that “some A are B” guarantees “some A are not B” – the latter is only possible, not definite, because the minimum diagram may have the whole of A inside B.

When a premise set contains a universal affirmative (“All A are B”) together with a particular affirmative (“Some B are C”), the definite conclusions are limited to those that can be derived by the transitive chain “All A are B” + “Some B are C” yields no definite conclusion about A and C (undistributed middle).. The conclusion “All A are C” is not definite because the particular premise does not distribute the middle term. Conversely, “Some A are not C” is only possible, since the minimum diagram can place all A inside C while still satisfying “Some B are C”. Practising the two‑diagram method on every new premise combination trains the mind to spot the distribution of terms and to avoid the trap of over‑generalising from a single diagram.

Examiners often frame answer options as “Only I follows”, “Only II follows”, “Either I or II follows”, “Neither I nor II follows”, and “Both I and II follow”. The “Either I or II follows” option appears exclusively when the two conclusions form a complementary pair – one affirmative, one negative – and together they exhaust all logical possibilities. In such cases each conclusion individually is only possible, but the pair as a whole is definite. Recognising this pattern requires checking whether the two conclusions are logical contradictories (e.g., “Some X are Y” vs “No X are Y”) or sub‑contraries (e.g., “Some X are Y” vs “Some X are not Y”). Only contradictory pairs generate a true either‑or situation; sub‑contrary pairs can both be true simultaneously, so “Either I or II follows” would be incorrect.

Complementary Pair Mechanics and Either-Or Logic

A complementary pair in syllogism consists of two conclusions that cannot both be false at the same time. The classic forms are the contradictory pair (A vs O, E vs I) and the contrary pair (A vs E) when the subject term is distributed in both. In the standard four‑figure mood list, the only moods that produce a genuine either‑or are those where the premises leave the relationship between the extreme terms completely undetermined – for example, “All A are B” and “Some B are not C”. Here the extreme terms A and C may be related as “Some A are C” (I) or “No A are C” (E). Both cannot be false together because if “Some A are C” is false then “No A are C” must be true, and vice‑versa. The examiner’s trick is to present the two conclusions as separate options and also include an “Either I or II follows” option. The correct choice is the either‑or option only when the two conclusions are logical contradictories covering the entire possibility space.

To verify a complementary pair, draw the two extreme Venn diagrams: one that makes the first conclusion true and the second false, and another that makes the second true and the first false. If both diagrams satisfy all premises, the pair is complementary. If a premise forces a specific relationship (e.g., “All A are B” and “All B are C” forces “All A are C”), then the contradictory conclusions cannot both be accommodated – one diagram will violate a premise – and the either‑or option is a distractor. Another frequent distractor is the sub‑contrary pair “Some A are B” and “Some A are not B”. Both can be true together (when A partially overlaps B and also has elements outside B), so they are not complementary; the correct answer in that situation is “Both I and II follow” if both are individually possible, or “Neither follows” if the premises forbid one of them.

Advanced questions sometimes embed a complementary pair inside a larger set of conclusions, asking “Which of the following conclusions follow?” with multiple statements. The test‑taker must first isolate the pair, confirm they are contradictories, and then check whether any other conclusion is definite. If a third conclusion is definite, the answer may be “Only III follows” or “Only III and either I or II follow”. The presence of a definite conclusion does not invalidate the either‑or nature of the pair; it merely adds another layer to the answer key. Mastery of this mechanic comes from systematic practice: list all conclusions, label each as definite, possible, or impossible, then apply the complementary‑pair rule only to the possible ones.

Worked Example – Complementary Pair Identification
Statements: 1. All engineers are graduates. 2. Some graduates are not managers. Conclusions: I. Some engineers are managers. II. No engineer is a manager. III. Some engineers are not managers. Determine which conclusion(s) follow.
Step 1: Translate premises. “All engineers are graduates” → Engineers ⊆ Graduates. “Some graduates are not managers” → There exists at least one graduate outside the Managers circle. Step 2: Draw minimum diagram – place Engineers entirely inside Graduates, and keep a portion of Graduates outside Managers. In this diagram Engineers may be wholly inside Managers, wholly outside, or partially overlapping; nothing forces a relation. Step 3: Draw maximum diagram – push Engineers as far into Managers as premises allow. Since only “Some graduates are not managers” is given, Engineers could still be completely inside Managers. Step 4: Evaluate conclusions. I (“Some engineers are managers”) is possible but not definite (fails in minimum diagram where Engineers are outside Managers). II (“No engineer is a manager”) is also possible but not definite (fails in maximum diagram where Engineers are inside Managers). I and II are contradictories (I vs E) and together exhaust all possibilities → they form a complementary pair. III (“Some engineers are not managers”) is the O proposition corresponding to the A “All engineers are managers”. Since “All engineers are managers” is not forced, III is merely possible, not definite. Because I and II are a complementary pair, the correct answer is “Either I or II follows”. III does not follow definitely, so it is not selected.
Exam‑Day Strategy
When you spot two conclusions that are direct contradictories (All vs Some‑not, No vs Some), pause and run the two‑diagram test. If both diagrams satisfy every premise, mark the either‑or option immediately; do not waste time checking other conclusions unless the question asks for “all that follow”. This single check often yields two marks in under thirty seconds.

Chain Syllogisms with Three or More Premises

Chain syllogisms extend the classic two‑premise format by linking three, four, or even five categorical statements. The logical engine remains the same: the middle term of each adjacent pair must be distributed at least once for a valid mediate inference. In a three‑premise chain such as “All A are B”, “All B are C”, “Some C are D”, the first two premises yield the definite intermediate “All A are C”. This new universal can then combine with the third premise. Because the third premise is particular (“Some C are D”), the middle term C is not distributed, so no universal conclusion about A and D follows. No definite conclusion follows between A and D; the middle term C is undistributed in both premises. obtained by aligning the universal “All A are C” with the particular “Some C are D” (the middle term C is undistributed in the universal “All A are C”). If the third premise were “All C are D”, the chain would produce “All A are D” – a universal conclusion. The rule of thumb: count the number of universal premises that distribute the shared term; each such distribution permits one step of universal propagation.

When a chain contains a negative premise (“No B are C” or “Some B are not C”), the polarity of the conclusion flips. A single negative premise in the chain forces the final conclusion to be negative (E or O). Two negatives make the conclusion affirmative again, but the middle term must still be distributed appropriately. For example, “All A are B”, “No B are C”, “All C are D” yields “No A are C” from the first two, and then “No A are D” cannot be derived because the middle term C is distributed in “All C are D” (subject of universal affirmative). The correct definite conclusion stops at “No A are C”. Examiners often add a fourth premise “Some D are not E” to test whether candidates incorrectly extend the chain beyond the last distributed middle term.

To solve chain syllogisms efficiently, write the premises in order, underline the distributed terms (subject of universal affirmatives, both terms of universal negatives, predicate of particular negatives). Then scan left‑to‑right: whenever a term appears as distributed in one premise and undistributed in the next, a mediate inference is possible. Record each intermediate conclusion; they become new premises for the next step. This systematic propagation avoids the common mistake of jumping directly from the first to the last premise, which ignores distribution requirements and produces invalid universals.

Handling Negative Premises and Particular Negatives

Negative premises – universal negative (E: “No A are B”) and particular negative (O: “Some A are not B”) – impose stricter constraints on what can be concluded. An E premise distributes both subject and predicate, allowing it to serve as a strong bridge in a chain. An O premise distributes only the predicate, which means the subject term remains undistributed and cannot act as a middle term for a universal conclusion. Consequently, any syllogism that relies on an O premise as the sole link between two extremes can yield at most a particular negative conclusion (O). For instance, “All A are B” + “Some B are not C” → the middle term B is distributed in the first premise (as predicate of a universal affirmative? Actually predicate of A is undistributed; wait: In “All A are B”, subject A is distributed, predicate B is undistributed. In “Some B are not C”, predicate C is distributed, subject B is undistributed. The middle term B is undistributed in both premises → no valid conclusion. This illustrates the classic “undistributed middle” fallacy that appears frequently in advanced questions.

When a set contains both an E and an O premise, the distribution pattern can rescue a conclusion. Example: “No A are B” (E) + “Some B are not C” (O). Here B is distributed in the E premise (both terms) and undistributed in the O premise (subject). The middle term B is distributed at least once, so a conclusion is possible. The conclusion must be negative (because at least one premise is negative) and particular (because one premise is particular). No definite conclusion follows between A and C; the premises allow A to be empty. Note that “No A are C” (E) would be too strong – the particular premise prevents a universal negative.

Examiners also test the conversion of negative statements. “No A are B” converts to “No B are A” (valid). “Some A are not B” does **not** convert to “Some B are not A” – that would be an illicit conversion. Many candidates mistakenly treat O as convertible, leading to false conclusions. The safe rule: only E and I convert simply; A converts by limitation (to I); O does not convert. Practising conversion drills alongside Venn diagrams eliminates this error.

Syllogism Integration in Analytical Reasoning Sets

Modern reasoning sections often embed syllogistic logic inside larger analytical reasoning puzzles – seating arrangements, grouping games, or conditional sequencing. The syllogism component usually appears as a set of categorical clues that must be combined with positional or relational clues. For example, a puzzle may state: “All doctors are engineers. Some engineers are teachers. No teacher is a lawyer.” Together with “The lawyer sits opposite the doctor” and “The teacher is not at the ends”, the solver must first resolve the categorical network to know which professions can occupy which seats. The categorical network yields definite relations: “All doctors are engineers” and “No teacher is a lawyer” give “No doctor is a lawyer” (since doctors ⊆ engineers, but engineers may include teachers; however “No teacher is a lawyer” does not directly affect doctors unless we know doctors are teachers, which we don’t). The only definite cross‑profession link is “Some engineers are teachers” (particular) and “No teacher is a lawyer” → “Some engineers are not lawyers” (O). This particular negative can be used to eliminate lawyer from the subset of engineers that are teachers, but not from all engineers.

The integration technique: first isolate all categorical statements, draw their Venn diagram, and list every definite and possible conclusion. Then treat each definite conclusion as a hard constraint in the puzzle (e.g., “No doctor is a lawyer” means those two roles cannot be assigned to the same person). Possible conclusions become conditional branches – explore them only if the puzzle permits multiple solutions. This two‑stage approach prevents the common error of mixing categorical reasoning with spatial reasoning prematurely, which leads to contradictory assignments.

Another pattern is the “syllogism‑based condition” where a rule reads: “If all managers are graduates, then the manager sits at position 3.” The test‑taker must verify whether the premise “All managers are graduates” is definitely true given the categorical clues. If the clues only make it possible, the condition is not triggered. Only when the categorical network yields a definite universal does the conditional fire. Recognising the difference between definite and possible categorical conclusions is therefore essential for solving hybrid sets accurately and quickly.

  • Assuming a particular affirmative (“Some A are B”) guarantees the corresponding particular negative (“Some A are not B”) – they are independent possibilities.
  • Treating an O premise as convertible – “Some A are not B” does not imply “Some B are not A”.
  • Ignoring distribution of the middle term in multi‑premise chains, leading to illicit universal conclusions.
  • Selecting “Either I or II follows” for sub‑contrary pairs (I vs O) instead of true contradictories (A vs O, E vs I).
  • Over‑extending a chain beyond the last distributed middle term, producing conclusions not supported by the premises.
  • Mixing definite categorical conclusions with possible ones when applying them as constraints in analytical puzzles.
  • Remember to verify each diagram against all premises before selecting an answer.

Quantifier Interaction in Multi-Premise Chains

When a syllogism contains more than two premises, the interaction of quantifiers determines whether a conclusion can be drawn and what its quantity and quality will be. The classical distribution rules still apply: a term is distributed if the statement makes an assertion about the entire extension of that term. In a chain of three or more premises, the middle term must be distributed at least once across the entire set, not merely in a single premise. If the middle term appears in two premises but is undistributed in both, the chain suffers from an undistributed middle and no valid conclusion follows, regardless of how many additional premises are present.

Consider a chain: “All A are B” (A), “Some B are C” (I), “No C are D” (E). The first premise distributes the subject A; the second distributes neither term; the third distributes both C and D. The middle terms are B (between premises 1 and 2) and C (between premises 2 and 3). B is undistributed in both premises 1 and 2, so the link A–C cannot be established. C is distributed in premise 3 but undistributed in premise 2, so the link B–D also fails. The only safe inference is the particular negative “Some B are not D” obtained by combining the I premise with the E premise through the distributed C. This illustrates that each adjacent pair must be checked for a distributed middle before the chain can be collapsed.

A practical shortcut is to mark each term with a distribution flag (D for distributed, U for undistributed) as you read the premises. Then scan the chain for any term that serves as a middle between two premises and carries at least one D. If none exists, the chain yields no definite conclusion. When a distributed middle is found, the conclusion’s quantity follows the “weakest” premise (particular if any premise is particular) and its quality follows the “most negative” premise (negative if any premise is negative). This rule holds even when the chain contains a mixture of universal affirmatives, particular affirmatives, universal negatives, and particular negatives.

Examiners often embed a hidden universal negative (E) among several affirmatives to test whether candidates recognise that a single negative premise forces a negative conclusion. For example: “All M are N”, “All N are O”, “Some O are not P”. The middle terms N and O are each distributed once (N in the first premise, O in the third). The chain permits the conclusion “Some M are not P” (O). Note that the universal affirmative premises do not distribute their predicates, so the distribution of O comes solely from the particular negative premise. Mastering this distribution audit eliminates the common error of drawing an affirmative conclusion from a chain that contains a negative premise.

Conditional Syllogisms and Hypothetical Reasoning

Standard categorical syllogisms deal with statements of the form “All A are B” or “Some A are not B”. In many advanced questions, premises are presented as conditionals: “If A then B”, “If B then C”, “If not C then not A”. These can be translated into categorical form by treating the antecedent and consequent as classes. “If A then B” is equivalent to “All A are B”. “If not C then not A” converts to “All non‑C are non‑A”, which by contraposition yields “All A are C”. Once every conditional is rendered as a categorical proposition, the usual Venn or distribution analysis applies.

A frequent twist is the presence of a biconditional (“A if and only if B”). This yields two universal affirmatives: “All A are B” and “All B are A”, effectively making the two classes co‑extensive. In a Venn diagram the circles for A and B completely overlap. When a biconditional appears alongside other premises, it can collapse two separate chains into one, often creating a distributed middle where none existed before. For instance, “All A are B”, “B if and only if C”, “Some C are not D” gives “All B are C” and “All C are B”. The middle term B is now distributed in the second premise (as subject of a universal affirmative), allowing the conclusion “Some A are not D”.

Another pattern is the “conditional premise with a negative consequent”: “If A then not B”. This translates to “All A are non‑B”, i.e. an E‑type statement “No A are B”. The negative quality propagates through the chain exactly as an explicit “No A are B” would. Candidates must be careful not to treat “If A then not B” as a particular statement; it is universal and distributes both terms.

When a set mixes categorical and conditional premises, the first step is always conversion of every conditional into its categorical equivalent. After conversion, list all distinct terms, draw a master Venn diagram (or Euler diagram for speed), and apply the distribution audit described in the previous section. The presence of a conditional does not alter the fundamental rules; it only adds a translation layer that many aspirants skip, leading to missed distributions and invalid conclusions.

Worked Example: Conditional Chain
Premises:
1. If X then Y.
2. If Y then not Z.
3. Some Z are W.
Which of the following conclusions definitely follows?
I. Some X are not W.
II. No X are Z.
III. Some W are not Y.
Step 1: Translate conditionals.
1. “If X then Y” → All X are Y (A).
2. “If Y then not Z” → All Y are non‑Z → No Y are Z (E).
3. “Some Z are W” → Some Z are W (I).
Step 2: Identify middle terms. Between 1 and 2 the middle is Y. Y is distributed in premise 2 (subject of E) and undistributed in premise 1 (predicate of A). Since Y is distributed at least once, a conclusion linking X and Z is possible. The premises contain a negative (E), so the conclusion must be negative. Premise 1 is universal, premise 2 is universal, so the conclusion can be universal negative: No X are Z (E). This matches conclusion II.
Step 3: Check other conclusions. I (“Some X are not W”) would require a link between X and W. The only link to W is through Z (premise 3). Z is undistributed in premise 3 (subject of I) and distributed in premise 2 (predicate of E). The middle Z is distributed once, so a conclusion between Y and W is possible: Some Y are not W (O). However X is only linked to Y via a universal affirmative, which does not distribute Y. Therefore X–W cannot be established; I does not follow.
III (“Some W are not Y”) is the converse of “Some Y are not W”. Conversion of an O proposition is invalid, so III does not follow.
Only conclusion II definitely follows.
Exam‑Day Strategy
When you see a conditional premise, immediately rewrite it in categorical form on your rough sheet. Use the standard equivalents: “If P then Q” = All P are Q; “If P then not Q” = No P are Q; “P only if Q” = All P are Q; “P if and only if Q” = All P are Q and All Q are P. This one‑minute translation prevents the most common error of treating conditionals as particular statements and saves time during the distribution audit.

Euler Diagram Extensions for Non‑Standard Forms

Venn diagrams with three circles are the default tool, but they become cumbersome when a problem involves four or more distinct terms or when premises include “Only”, “None but”, “All except”, and similar quantifiers. Euler diagrams — where circles are drawn only to reflect actual inclusion or exclusion — can represent these forms more compactly. For example, “Only A are B” means “All B are A”. In an Euler diagram the B circle lies entirely inside the A circle, and no other circle overlaps B unless forced by another premise. “All except A are B” translates to “All non‑A are B”, which is represented by a large circle for the universe, a circle for A, and a circle for B that covers the entire region outside A.

When a premise contains a numerical quantifier such as “At least 30 % of A are B”, the exact proportion cannot be captured in a pure Euler diagram, but the logical force is the same as “Some A are B”. Treat any “at least one” or “some” language as an I‑type statement for the purpose of distribution. Conversely, “At most 30 % of A are B” does not yield a standard categorical form; it only tells us that “Some A are not B” is possible but not definite. In such cases, mark the relation as “possible” rather than “definite” and keep it separate from the definite diagram.

A powerful technique for four‑term problems is to draw two overlapping Euler diagrams that share a common term. Suppose the premises are: “All A are B”, “Some B are C”, “No C are D”, “All D are E”. Draw the first three terms (A, B, C) in one diagram and the last three (C, D, E) in another, aligning the C circles. The shared C region becomes the bridge. Definite conclusions are read off each diagram independently, then combined. This modular approach avoids the clutter of a single five‑circle Venn diagram and reduces the chance of mis‑reading overlapping regions.

Examiners sometimes test the “Only” construction in reverse: “Only those who are A are B” is logically “All B are A”, not “All A are B”. A quick check: replace “Only” with “All” and swap the terms. If the sentence reads “All B are A”, the translation is correct. Practising this swap on a few sample sentences builds an automatic reflex that saves precious seconds.

Strategic Use of Complementary Pairs in Either‑Or Questions

Either‑Or questions present two conclusions that are logical contradictories (A vs O, E vs I) and ask whether exactly one follows. The key is to determine whether the premises force a definite truth value for the universal member of the pair. If the universal (A or E) is definitely true, the particular contradictory (O or I) is definitely false, and the answer is “Only I follows” (or “Only II follows”). If the universal is definitely false, the particular must be true, and again only one follows. The tricky case occurs when the premises make the universal neither definitely true nor definitely false — i.e., the universal is possible but not certain. In that situation both the universal and its contradictory are possible, so neither can be selected as a definite conclusion; the correct response is “Neither I nor II follows”.

To apply this strategically, first test the universal conclusion using the distribution audit. If the middle term is distributed and the quantity/quality rules allow the universal, mark it as “definite”. If the audit fails, test whether the universal is contradicted by any premise (e.g., a particular negative that directly opposes a universal affirmative). If a direct contradiction exists, the universal is “definitely false”. Only when the universal is neither definite nor contradicted do you fall back to the “possible” zone.

Consider the pair: I. All A are B (A). II. Some A are not B (O). Premises: “All A are C”, “Some C are B”. The middle term C is undistributed in both premises, so the universal “All A are B” is not definite. Is it definitely false? No premise asserts “Some A are not B” or “No A are B”. Therefore the universal is possible but not certain, and the particular is also possible. The answer is “Neither I nor II follows”. Many candidates incorrectly choose “Either I or II follows” because they recognise the pair as contradictories, forgetting that the “either‑or” option requires one to be logically forced.

A second strategic layer appears when the question offers three conclusions, two of which form a complementary pair and the third is unrelated. The instruction “Only one conclusion follows” often hides the fact that the unrelated conclusion is the only definite one. Always evaluate every conclusion independently before applying the either‑or logic. This prevents the trap of forcing a complementary‑pair decision when a standalone definite conclusion exists.

Time‑Bound Solving Framework for High‑Difficulty Sets

High‑difficulty syllogism sets typically contain 5–7 premises, multiple either‑or pairs, and a mix of categorical, conditional, and “only” statements. A disciplined time‑bound framework ensures that you extract every definite conclusion within 90–120 seconds. The framework consists of four stages:

  1. Rapid Translation (15 s): Convert every premise into standard categorical form (A, E, I, O). Write the symbolic letters next to each premise.
  2. Distribution Audit (30 s): List all distinct terms. For each premise, mark subject and predicate as D or U. Identify every middle term that appears in at least two premises. Flag any middle term that is D in at least one occurrence.
  3. Definite Conclusion Generation (30 s): For each flagged middle term, apply the quantity/quality rule: conclusion is particular if any premise in the pair is particular; negative if any premise is negative. Write the resulting conclusion in symbolic form (e.g., A‑E → O). Collect all such conclusions; discard duplicates.
  4. Either‑Or Evaluation (15 s): For each either‑or pair, check the universal member against the definite list. If present → universal true, particular false. If its contradictory is present → universal false, particular true. If neither → neither follows.

After the four stages, match the generated conclusions with the answer options. If an option contains a conclusion not in your definite list, it is incorrect. If an option matches a definite conclusion, it is correct. For “possible” conclusions (those that survive the audit but are not forced), only select them when the question explicitly asks “Which of the following is possible?”.

Practice this framework on timed drills of 10 mixed sets. Track the time spent in each stage; the translation stage often overruns because candidates linger on “only” and “unless” phrasing. Build a personal cheat‑sheet of the most common translations (e.g., “Unless A, B” = “If not A then B” = “All non‑A are B”). Internalising these translations reduces the translation stage to under 10 seconds, giving you a comfortable margin for the audit.

  • Assuming a middle term is distributed simply because it appears in two premises — verify distribution in each premise individually.
  • Treating “Only A are B” as “All A are B” instead of the correct “All B are A”.
  • Converting a particular negative (O) as if it were convertible — “Some A are not B” does not imply “Some B are not A”.
  • Selecting “Either I or II follows” for a complementary pair when the universal is merely possible, not definite.
  • Ignoring the negative quality propagation: a single negative premise forces a negative conclusion, even if other premises are universal affirmatives.
  • Over‑extending a chain beyond the last distributed middle term, producing conclusions not supported by the premises.

Practice Questions

← Direction and Distance Puzzles and Seating Arrangement →