Reverse Syllogism (Framing Statements from Given Conclusions)
Reasoning › Syllogism · Topic 9.8
Reverse syllogism works backward: a conclusion is given and you must pick the statements, or the missing statement, that make it follow. Look at what the conclusion needs, choose statements that link its two terms through a common middle term, and check each option with the pair table.
8 min read · Reasoning · Syllogism
Quick Answer
Reverse syllogism works backward: a conclusion is given and you must pick the statements, or the missing statement, that make it follow. Look at what the conclusion needs, choose statements that link its two terms through a common middle term, and check each option with the pair table.
At a Glance
- Goal Find statements that give the conclusion
- Conclusion Some A are C Needs a Some or All link through B
- Conclusion No A is C Needs All A are B and No B is C
- Conclusion Some C are not A Needs No A is B and All B are C
- Check Run the pair table forward
- Elimination Remove options with two particular or two negative statements
Where Does It Fit?
This topic reverses the pair table of Syllogism with Two Statements and Two Conclusions and uses the negative rows of Syllogism with Statements Containing a Negative or ‘No’ Relation. The next topic, Syllogism Involving Quantifiers ‘Some’, ‘All’, ‘No’ and ‘Only’ in Combination, brings in the word Only along with All, Some and No.
Which Statements Produce Which Conclusion?
In short: each conclusion type has a short list of statement pairs that produce it.
| Conclusion | Pairs that give it |
|---|---|
| All A are C | All A are B and All B are C |
| Some A are C | All A are B and All B are C; Some A are B and All B are C; All B are A and Some B are C |
| No A is C | All A are B and No B is C; No A is B and All C are B |
| Some A are not C | Some A are B and No B is C |
| Some C are not A | No A is B and All B are C |
Elimination
- Remove any option with two particular statements.
- Remove any option with two negative statements.
- Remove any option with no common middle term.
How Do You Find the Missing Statement?
In short: given one statement and the conclusion, choose the second statement that completes a valid pair.
- Identify the middle term in the given statement.
- Write what the second statement must say to link it to the conclusion.
- Test each option with the pair table.
- Choose the one that makes the conclusion follow.
For the first statement Some A are B and the conclusion Some A are C, the second statement must be All B are C. Some B are C, No B is C and All C are B do not work.
How Do You Check an Option?
In short: run the pair table forward on the option and see whether the conclusion appears.
- Forward check: use Syllogism with Two Statements and Two Conclusions or the diagrams of Syllogism Using Venn Diagram Method.
- Only one option: exam questions are designed so that exactly one option works.
- Close options: options that differ only in the direction of a universal statement are the usual traps.
Solved Examples
Example 1
Question: Which pair of statements makes Some A are C follow? (a) Some A are B; Some B are C. (b) All A are B; Some C are B. (c) All B are A; Some B are C. (d) No A is B; All B are C.
- (a) has two particular statements: no conclusion.
- (b) has the middle term in the predicate of both statements: no conclusion.
- (c) says all B are A and some B are C, so those B members are A and C: Some A are C follows.
- (d) gives only Some C are not A.
Answer: (c).
Example 2
Question: Which pair makes Some C are not A follow? (a) No A is B; All B are C. (b) All A are B; All B are C. (c) Some A are B; Some B are C. (d) All B are A; All B are C.
- (a) gives Some C are not A.
- (b) gives All A are C and nothing about Some C are not A.
- (c) has two particular statements.
- (d) gives Some A are C only.
Answer: (a).
Example 3
Question: Which pair makes No A is C follow? (a) All A are B; No B is C. (b) No A is B; No B is C. (c) Some A are B; No B is C. (d) No A is B; Some B are C.
- (a) puts A inside B and B apart from C, so No A is C follows.
- (b) has two negative statements.
- (c) gives only Some A are not C.
- (d) gives only Some C are not A.
Answer: (a).
Example 4
Question: Which pair makes Some A are not C follow? (a) Some A are B; No B is C. (b) All A are B; All B are C. (c) No A is B; All B are C. (d) Some A are B; Some B are C.
- (a) gives Some A are not C directly.
- (b) gives All A are C, which contradicts the conclusion.
- (c) gives only Some C are not A.
- (d) has two particular statements.
Answer: (a).
Example 5
Question: Statement 1: Some A are B. Conclusion: Some A are C. Which second statement is needed? (a) Some B are C. (b) No B is C. (c) All B are C. (d) All C are B.
- The B members that are A must also be C, so all B must be C.
- Some B are C and All C are B do not force the B members that are A into C.
Answer: (c).
Shortcuts and Tricks
- First write what the conclusion needs, then scan the options.
- Remove options with two particular or two negative statements first.
- Watch the direction of All in each option.
- Check the surviving option with the pair table.
- A conclusion with Some not needs a No statement in the pair.
Common Mistakes
- Choosing an option with a correct middle term but the wrong direction.
- Choosing two particular statements.
- Confusing Some C are not A with Some A are not C.
- Not checking the option forward.
- Picking an option because it looks familiar.
Practice Questions
- Which pair gives All A are C: All A are B; All B are C, or Some A are B; All B are C?
- Which pair gives No A is C: All A are B; No B is C, or Some A are B; No B is C?
- Statement 1: All A are B. Conclusion: No A is C. Which second statement is needed: No B is C, or Some B are C?
- Which pair gives Some A are not C: Some A are B; No B is C, or Some A are B; Some B are C?
- Which pair gives Some C are not A: No A is B; All B are C, or All A are B; All B are C?
- Statement 1: Some A are B. Conclusion: Some A are C. Is All B are C the second statement needed?
Answers: 1) All A are B; All B are C; 2) All A are B; No B is C; 3) No B is C; 4) Some A are B; No B is C; 5) No A is B; All B are C; 6) yes.
Why Is This Topic Important?
- Deeper test It checks whether you understand why the table works.
- Exam twist Reverse questions appear in advanced papers.
- Speed Elimination removes most options.
- Link It reinforces the negative rows.
What Comes Next?
The next topic is Syllogism Involving Quantifiers ‘Some’, ‘All’, ‘No’ and ‘Only’ in Combination. It covers statements with Only, and combinations of All, Some and No.
Key Terms and Formulas
- Reverse syllogism Finding statements for a given conclusion
- Missing statement The second statement that completes a pair
- Elimination Removing options that cannot work
- Direction Which group is the subject and which the predicate
- Valid pair A pair of statements that gives a conclusion
- Trap option An option that looks right but fails
Related Topics
- Syllogism with Statements Containing a Negative or ‘No’ Relation
- Syllogism Involving Quantifiers ‘Some’, ‘All’, ‘No’ and ‘Only’ in Combination
- Syllogism with Two Statements and Two Conclusions
- Syllogism with Multiple Statements and Multiple Conclusions
Exam Corner
Points to Remember
- Work out what the conclusion needs.
- Remove two-particular and two-negative options.
- Check the direction of All.
- Verify the survivor forward.
- Exactly one option should work.
Do Not Confuse With
- Forward vs reverse Forward finds the conclusion; reverse finds the statements.
- Some C not A vs Some A not C The two have different pairs.
- All B are A vs All A are B The direction of All decides the conclusion.
- Pair vs single A conclusion needs a pair with a common middle term.
Memory Hook
Ask what the conclusion needs, then pick the pair that supplies it.
GS Relevance
Frequently Asked Questions
What is reverse syllogism?
Reverse syllogism gives a conclusion and asks you to find the statements, or the missing statement, that make it follow. You work backward: decide what pair of statements through a common middle term gives the conclusion, then match the options using the pair table.
Which statements give the conclusion Some A are C?
Some A are C follows from All A are B with All B are C, from Some A are B with All B are C, and from All B are A with Some B are C. Two particular statements, or a middle term in both predicates, never give it.
Which statements give No A is C?
No A is C follows from All A are B with No B is C, and from No A is B with All C are B. It does not follow from two negative statements, or from Some A are B with No B is C, which gives only Some A are not C.
How do you find a missing statement in syllogism?
Identify the middle term in the given statement, work out what the second statement must say to link it to the conclusion, and test each option with the pair table. For Some A are B and Some A are C, the missing statement is All B are C.
How can I quickly eliminate options in reverse syllogism?
Remove any option with two particular statements, two negative statements, or no common middle term. Then check the direction of each All statement, since the wrong direction is the usual trap. Verify the surviving option forward to be sure it gives the conclusion.
PYQ Practice — Statement Analysis
1 All B are A and Some B are C together give Some A are C.
Those B members are both A and C.
2 Some A are B and Some B are C together give Some A are C.
Two particular statements give no conclusion.
3 All A are B and No B is C together give No A is C.
A is inside B, which is separate from C.
4 No A is B and All B are C together give Some A are not C.
They give Some C are not A.
Related Topics
Browse the full Reasoning index