Study guide

5.1 Syllogisms (Only a few, Some not & Reverse Syllogism)

SBI PO Probationary Officer

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & SBI PO Exam Architecture

1.1 SBI PO Exam Structure, Phases & Sectional Timing 1.2 Eligibility, Age Relaxation & Number of Attempts 1.3 Mark Calculation, One-Fourth Negative Marking & Cut-offs 1.4 Descriptive Communication Test (Email, Situation, Report/Précis) 1.5 Phase 3: Psychometric Test, Group Exercise & Interview Preparation 1.6 Recommended Study Plan & Mock Test Strategy

2 Chapter 2: Quantitative Aptitude — Foundation & Speed Math

2.1 Vedic Math, Fast Calculation & Approximation Techniques 2.2 Number Series (Missing & Wrong Number Patterns) 2.3 Quadratic Equations & Quantity Comparisons (Q1 vs Q2) 2.4 Simplification & Order of Operations 2.5 Data Sufficiency in Quantitative Aptitude

3 Chapter 3: Arithmetic & Applied Problem Solving

3.1 Percentages, Profit, Loss & Discount Calculations 3.2 Simple Interest & Compound Interest (Compounding Cycles & Differences) 3.3 Ratio & Proportion, Partnerships & Ages 3.4 Averages, Mixtures & Alligations 3.5 Time, Work, Efficiency & Pipes & Cisterns 3.6 Speed, Distance, Time, Trains & Boats/Streams 3.7 Permutation, Combination & Probability in Banking Exams

4 Chapter 4: Advanced Data Analysis & Data Interpretation (DI)

4.1 Table & Line Graph Data Interpretation 4.2 Bar Chart & Pie Chart Data Interpretation 4.3 Caselet Data Interpretation (Paragraph-based DI & Venn Caselets) 4.4 Missing Data DI & Radar/Spider Graph Interpretation 4.5 Arithmetic-based DI (Profit-Loss, Time-Work, TSD) & Funnel/Scatter DI

5 Chapter 5: Analytical Reasoning

5.1 Syllogisms (Only a few, Some not & Reverse Syllogism) 5.2 Coded & Mathematical Inequalities 5.3 Coding-Decoding (Coded Statements & Mains Patterns) 5.4 Blood Relations & Direction Sense 5.5 Input-Output Machine Rearrangement

6 Chapter 6: Puzzles & Seating Arrangement

6.1 Linear & Circular Seating Arrangement (Single/Parallel Rows & Variable Binding) 6.2 Floor & Box Puzzles (Multi-story, Vacant floor & Stacking Order) 6.3 Matrix & Category Puzzles (Department/Profession Allocation & Constraint Elimination) 6.4 Scheduling Puzzles (Day-Month-Year combinations & Time Slots)

7 Chapter 7: Critical Reasoning

7.1 Statement & Implicit Assumptions 7.2 Statement & Conclusions vs Strong/Weak Arguments 7.3 Statement & Course of Action 7.4 Cause & Effect Analysis 7.5 Critical Reasoning Passages (Strengthen/Weaken & Paradox Resolution)

8 Chapter 8: English Language

8.1 Reading Comprehension: Tone, Inference, Main Idea & Vocab in Context 8.2 Cloze Test & Double/Triple Fillers 8.3 Para Jumbles & Sentence Rearrangement 8.4 Error Spotting & Phrase Replacement (Grammar Rules) 8.5 Word Usage, Synonyms/Antonyms & Contextual Meaning 8.6 Match the Columns & Sentence Connectors/Starters

9 Chapter 9: Banking & Financial Awareness

9.1 Reserve Bank of India (RBI): History, Structure & Functions 9.2 Monetary Policy Framework: MPC, Repo Rate, SDF, MSF, CRR, SLR & Inflation Targeting 9.3 Indian Financial System: Commercial Banks, Small Finance Banks, Payment Banks & NBFCs 9.4 Financial Inclusion & Government Banking Schemes (PMJDY, PMSBY, PMJJBY, APY, MUDRA, KCC) 9.5 Banking Current Affairs & Financial News Dynamics

10 Chapter 10: General & Banking Awareness — Indian Economy, Financial Markets & Regulations

10.1 Economic Indicators: GDP, NNP, WPI, CPI, IIP & National Income 10.2 Forex & International Trade: Balance of Payments, LRS, NEER/REER & World Bank/IMF 10.3 Union Budget & Economic Survey: Fiscal Deficit, CapEx & Revenue Receipts 10.4 Money Market vs Capital Market: T-Bills, Commercial Paper, CD, Stocks, Bonds & SEBI 10.5 Priority Sector Lending (PSL), Non-Performing Assets (NPAs), SARFAESI, IBC & Basel III

11 Chapter 11: Computer Aptitude

11.1 Computer Fundamentals & Hardware Architecture 11.2 Operating Systems & System Software 11.3 Networking Concepts & Internet Protocols 11.4 Cybersecurity & Banking IT Security 11.5 Database Management Systems (DBMS) & MS Office Suite

5.1 Syllogisms (Only a few, Some not & Reverse Syllogism)

Key Takeaways Explain This Topic AI

The exclusive quantifier 'Only A is B' translates strictly to 'All B are A', with the hidden constraint that B cannot overlap with any third element.

The quantifier 'Only a few A are B' asserts two definite statements simultaneously: 'Some A are B' and 'Some A are not B'.

Possibility conclusions are logically valid if and only if the relationship between elements is undetermined and does not contradict any definite premise.

An 'Either-Or' complimentary pair requires identical subjects and predicates, both conclusions being individually undetermined, and complementary polarities (Some + No or All + Some not).

Reverse Syllogism speed-solving relies on analyzing conclusion polarity and eliminating statement sets containing direct cross-relations before drawing candidate Venn diagrams.

Last updated: July 2026

Modern Syllogisms for SBI PO

Syllogism questions in the State Bank of India Probationary Officer (SBI PO) examination have evolved significantly beyond traditional categorical logic. Contemporary Prelims and Mains papers feature specialized quantifiers such as 'Only' , 'Only a few' , 'Can never be' , and 'Reverse Syllogism' . Solving these questions requires strict adherence to formal set theory rules and Euler/Venn diagram representation without relying on intuitive or real-world assumptions.

Standard vs. Exclusive Quantifiers

To master modern syllogisms, you must understand the precise set-theoretic translations of standard and exclusive statements.

Standard Quantifiers

All A are B: The set A A A is a subset of set B B B ( A ⊆ B A \subseteq B A ⊆ B ).

Some A are B: The intersection of set A A A and set B B B is non-empty ( A ∩ B ≠ ∅ A \cap B \neq \emptyset A ∩ B  = ∅ ).

No A is B: Set A A A and set B B B are completely disjoint ( A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ ).

Some A are not B: At least one element of set A A A lies outside set B B B ( A ∖ B ≠ ∅ A \setminus B \neq \emptyset A ∖ B  = ∅ ).

  • Modern Exclusive Quantifiers
  • The 'Only' Quantifier

A statement of the form 'Only A is B' translates to 'All B are A' with a critical, non-negotiable exclusivity constraint: B can NEVER have any positive overlap with any other element except A .

Example Statement: "Only Bankers are Managers."

Translation: All Managers are Bankers. Furthermore, No Manager can be an Analyst, Director, or any third variable mentioned in the question.

The 'Only a few' Quantifier

A statement of the form 'Only a few A are B' is a compound quantifier that asserts two definite facts simultaneously :

  • Some A are B (Positive Definite relation)
  • Some A are not B (Negative Definite relation)

Quantifier Statement Standard Logical Translation Definite Inferences Valid Possibility Case Invalid Possibility Case

Only A is B All B are A + B is exclusive to A No B is C (where C is any third variable) All A being B is a possibility All B being C is a possibility

Only a few A are B Some A are B AND Some A are not B Some B are A; Some A are not B All B being A is a possibility All A being B is a possibility

A few / Almost / At least A are B Some A are B Some B are A All A being B is a possibility No A is B

Can never be Definite Negative (Some ... are not) Non-possibility statement Depends on diagram Converting to simple possibility

Rules for Definite Conclusions and Possibilities

A conclusion in syllogism can fall into one of three truth states:

Definitely True: Supported by all valid minimum-overlapping Venn diagrams.

Definitely False: Directly contradicts at least one given premise.

Undetermined (Can't Say): Neither definitely true nor definitely false based on the minimum-overlapping model.

Possibility Rule Matrix

A conclusion phrased as a possibility (e.g., "All A being B is a possibility") is evaluated based on the baseline truth value of the definite statement:

Definitely True + Possibility = FALSE (If it is already certain, stating it as a possibility is logically redundant and invalid).

Definitely False + Possibility = FALSE (If it violates a premise, it can never occur).

Undetermined (Can't Say) + Possibility = TRUE (If no direct boundary prevents it, the scenario is logically plausible).

'Can Never Be' Statements

The phrase 'All A can never be B' is NOT a possibility conclusion; it is a definite negative conclusion . It translates directly to: 'Some A are not B' (or in certain contexts, 'No A is B'). If you can prove that even a small portion of set A A A is restricted from entering set B B B , then "All A can never be B" is definitely true.

Complimentary Pairs and Either-Or Rules

When two conclusions are individually undetermined (Can't Say), they may form an 'Either-Or' relationship if they represent mutually exhaustive scenarios. For an Either-Or relationship to hold, all three of the following conditions must be satisfied:

Same Elements: Both conclusions must contain the exact same subject and predicate (e.g., A A A and B B B ).

Both Undetermined: Both conclusions must be individually 'Can't Say' (neither definitely true nor definitely false).

Valid Complimentary Pair: The conclusions must belong to one of two valid complimentary pair combinations:

  • Pair 1: Some A are B + No A is B
  • Pair 2: All A are B + Some A are not B

Warning

Common Trap: The combination All A are B + No A is B does NOT form an Either-Or pair because both statements can be false simultaneously if Some A are B and Some A are not B .

Reverse Syllogism Strategy

In Reverse Syllogism, the conclusions are given in the question stem, and you must select the set of statements from the options that yields those conclusions.

4-Step Elimination Protocol

Analyze Conclusion Polarity: If all given conclusions are positive, any option containing negative statements ( No , Some not , Only a few ) is highly suspicious or invalid unless compensated.

Identify Cross-Restrictions: If a conclusion states "No A is C", look for a statement set that provides a direct or indirect negative link between A A A and C C C . Eliminate option sets where A A A and C C C are only connected via positive 'Some' relations.

Scan for Exclusive Quantifiers: If a conclusion states "Some A are not B", look for 'Only a few A are B' or 'No A is B' in the statements.

Draw Minimum Overlap Diagrams for Shortlisted Options: Never draw Venn diagrams for all 5 options. Use steps 1–3 to eliminate 3 options, then draw diagrams only for the remaining 2 candidate sets.

Step-by-Step Worked Example

Premises:

Only a few Laptops are Desktops.

All Desktops are Monitors.

Only Monitors are Servers.

No Desktop is a Printer.

Conclusions to Evaluate:

Conclusion I: All Laptops being Desktops is a possibility.

Conclusion II: No Server is a Desktop.

Conclusion III: Some Monitors are not Printers.

Step-by-Step Logical Trace

Decode Statement 1: 'Only a few Laptops are Desktops' ⟹ \implies ⟹ Some Laptops are Desktops AND Some Laptops are not Desktops .

Decode Statement 3: 'Only Monitors are Servers' ⟹ \implies ⟹ All Servers are Monitors AND Servers cannot overlap with Laptops, Desktops, or Printers .

Evaluate Conclusion I: Statement 1 mandates that a portion of Laptops can NEVER be Desktops. Therefore, putting ALL Laptops inside Desktops violates Statement 1. Result: FALSE .

Evaluate Conclusion II: Because Servers are exclusive to Monitors (Statement 3), Servers cannot be Desktops. Result: TRUE .

Evaluate Conclusion III: All Desktops are inside Monitors (Statement 2), and No Desktop is a Printer (Statement 4). The portion of Monitors occupied by Desktops can never be Printers. Therefore, at least those Monitors are not Printers. Result: TRUE .

Final Answer: Conclusions II and III follow.