SSC CPO /Reasoning Ability

Statement & conclusion

Logical Reasoning · free study notes

SSC CPO – Reasoning Ability

Topic: Statement & Conclusion

SSC CPO (Combined Police Officer) is a competitive exam that tests candidates on logical reasoning, quantitative aptitude, and verbal skills.
The Statement & Conclusion sub‑section is one of the hardest logical puzzles. It tests the ability to draw valid inferences from a set of premises.


Table of Contents

  1. Problem Definition
  2. Fundamental Logical Concepts
    • 2.1. Propositions, Premises, Conclusions
    • 2.2. Logical Connectives & Truth Tables
    • 2.3. Validity & Soundness
  3. Structural Analysis of Statement‑Conclusion Items
    • 3.1. Common Patterns
    • 3.2. Inference Rules
    • 3.3. Edge‑Case Pitfalls
  4. Advanced Techniques
    • 4.1. Truth‑Table Exhaustive Search
    • 4.2. Binary Matrix Representation
    • 4.3. Graph‑Theoretic Modelling
  5. Step‑by‑Step Solution Template
  6. Sample Problem (with Full Solution)
  7. Challenging Problem for Practice
  8. Common Misconceptions & Tips
  9. Further Reading

<a name="1"></a>

1. Problem Definition

A Statement‑Conclusion question presents:

  1. Statement (S) – A set of premises (facts, conditions, or observations).
  2. Conclusion (C) – A proposed inference that may follow from S.
  3. Answer Choices – Usually 4 statements or 4 options:
    • Both S and C are true,
    • Only S is true,
    • Only C is true,
    • Neither S nor C is true.

Objective: Determine the logical relationship between S and C.


<a name="2"></a>

2. Fundamental Logical Concepts

2.1. Propositions, Premises, Conclusions

Symbol Meaning
(p, q, r, \dots) Simple propositions (atomic statements).
(S) Set of premises (premise‑set).
(C) Conclusion statement.

2.2. Logical Connectives & Truth Tables

Symbol Operation Truth Table (p, q, r)
(\wedge) AND 1 only if both true
(\vee) OR 1 if at least one true
(\neg) NOT 1 if operand false
(\rightarrow) Implication 0 only if p true & q false
(\leftrightarrow) Biconditional 1 if both same

Key: Every logical expression can be expressed using these connectives.

2.3. Validity & Soundness

  • Validity: A logical argument is valid if every truth assignment that makes all premises true also makes the conclusion true.
  • Soundness: Validity + actual truth of premises.
    In SSC, premises are assumed true (the statement is a set of facts). Thus, we only need to check validity.

<a name="3"></a>

3. Structural Analysis of Statement‑Conclusion Items

3.1. Common Patterns

Pattern Example How to Approach
Direct Implication S: A → B. C: A. S ⊢ C? No (requires B).
Contrapositive S: A → B. C: ¬B → ¬A. Valid.
Disjunctive Syllogism S: A ∨ B, ¬A. C: B. Valid.
Modus Ponens S: A, A → B. C: B. Valid.
Modus Tollens S: A → B, ¬B. C: ¬A. Valid.
Biconditional S: A ↔ B. C: (A ∧ B) ∨ (¬A ∧ ¬B). Equivalent.
Quantifier‑like S: “All X are Y” (∀x X(x)→Y(x)). C: “No X is ¬Y” (∀x X(x)→Y(x)). Equivalent.

3.2. Inference Rules (Condensed)

Rule Format Example
Modus Ponens (p, p → q ⊢ q) A, A→B ⊢ B
Modus Tollens (p → q, ¬q ⊢ ¬p) A→B, ¬B ⊢ ¬A
Hypothetical Syllogism (p → q, q → r ⊢ p → r) A→B, B→C ⊢ A→C
Disjunctive Syllogism (p ∨ q, ¬p ⊢ q) A∨B, ¬A ⊢ B
Constructive Dilemma (p → q, r → s, p ∨ r ⊢ q ∨ s) A→B, C→D, A∨C ⊢ B∨D
Inverse (¬p → ¬q) (not a valid inference from (p → q)) A→B, ¬A → ¬B (invalid)

3.3. Edge‑Case Pitfalls

Pitfall Description Remedy
Premise not actually a premise Statement may contain facts that are not logical premises (e.g., “If I am in the room, then the door is closed”). Identify implications and treat them as premises.
Implicit “Either‑Or” “Either A or B” may be exclusive or inclusive. In SSC, it is usually inclusive unless stated. Assume inclusive unless “only” is mentioned.
Contradictory Premises S may contain contradictions; treat as inconsistent, but still analyze logically. A contradiction makes every conclusion tautologically

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.