Statement‑&‑Conclusion Reasoning
IIT‑M.Tech Admission – Reasoning Ability
Objective – In a Statement‑Conclusion (S‑C) question you are given a statement (S) and one or more conclusions (C).
Your task is to decide which conclusion is logically supported by the statement.
In competitive exams the most common format is:
- Single‑choice – choose the only correct conclusion.
- Multiple‑choice – choose all correct conclusions.
- True‑False – each conclusion is marked as true (always follows) or false (never follows).
Why it matters – The S‑C type is the most frequently occurring reasoning sub‑topic in IIT‑JEE‑M.Tech, TCS‑IIT, JEE‑Advanced, etc. Mastery of this skill means you can answer all other reasoning patterns (hypothetical syllogisms, logical reasoning, conditional statements, etc.) with confidence.
1. Foundations
| Term | Definition | Example |
|---|---|---|
| Statement (S) | A factual, descriptive, or conditional sentence. | All students who passed the exam were present in the hall. |
| Conclusion (C) | A claim that may follow from S (or not). | Every present person passed the exam. |
| Inference | Logical reasoning that bridges S → C. | Deduction, induction, or abduction. |
| Validity | C is valid if every possible scenario that makes S true also makes C true. | If S is “All A are B” and C is “Some A are B”, C is valid. |
| Soundness | Valid conclusion with a true statement. | If S is false, any conclusion cannot be guaranteed. |
Key Insight – Validity is independent of the truth value of S. It solely concerns the logical structure.
2. Logical Connectors & Their Inference Rules
| Connector | Meaning | Primary Inference |
|---|---|---|
| All A are B | Every member of A is also a member of B. | Universal Instantiation (UI): Pick an element x∈A ⇒ x∈B. |
| No A are B | No element of A belongs to B. | Universal Negation: If x∈A ⇒ x∉B. |
| Some A are B | There exists at least one element that is both A and B. | Existential Instantiation (EI): Let x∈A∩B. |
| Some A are not B | There exists at least one element in A that is not in B. | Existential Negation: x∈A & x∉B. |
| If P, then Q | Conditional (P → Q). | Modus Ponens: P true ⇒ Q true. Modus Tollens: Q false ⇒ P false. |
| P or Q | At least one of P or Q is true. | Disjunctive Syllogism: If ¬P, then Q. |
| P and Q | Both P and Q are true. | Conjunction: From S, you can infer both P and Q separately. |
| Not P | P is false. | Negation. |
| Unless | “P unless Q” ≡ “if not Q, then P”. | Translate to conditional. |
| If and only if (iff) | P ⇔ Q (both P→Q and Q→P). | Use both directions. |
Rule of Thumb – Convert every statement into a formal logical expression (using quantifiers ∀, ∃, →, ∨, ∧, ¬) before analyzing conclusions.
Common Patterns
-
Universal → Existential
- All A are B → Some B are A (valid).
- All A are B → All B are A (invalid unless B⊆A).
-
Universal → Universal
- All A are B → All A are B (tautology).
- All A are B → All B are A (invalid).
-
Existential → Universal
- Some A are B → All A are B (invalid).
-
Conditional Chains
- If P then Q and If Q then R → If P then R (transitivity).
3. The “Truth‑Table” Method for S‑C
| S | C | Is C always true when S is true? | Is C always false when S is false? | Conclusion? |
|---|---|---|---|---|
| True | True | ✔ | ? | Valid |