📚 Reasoning Ability – Statement & Conclusion
Target Exam: Odisha PSC (and any other competitive exam like IIT‑JEE reasoning section)
Format: Statement–Conclusion (SC) type questions
Goal: Master the systematic way to decide whether a conclusion follows from a given statement, and to identify the type of conclusion (true, false, possible, impossible).
1. What is a Statement‑Conclusion (SC) Question?
| Component | Description |
|---|---|
| Statement (S) | A single, self‑contained fact or proposition. |
| Conclusion (C) | A proposition that is derived from the statement. |
| Answer Key | 4 options: (a) C is true, (b) C is false, (c) C may be true or false, (d) C is undecidable. |
| Task | Determine the logical status of (C) with respect to the given (S). |
Key Rule:
(C) is true iff it necessarily follows from (S).
(C) is false iff it cannot follow from (S).
(C) is possible iff both (C) and (\lnot C) are consistent with (S).
(C) is undecidable iff (C) is neither necessarily true nor necessarily false.
2. The Logical Toolkit
| Symbol | Meaning | Example |
|---|---|---|
| (\land) | AND | (P \land Q) |
| (\lor) | OR | (P \lor Q) |
| (\neg) | NOT | (\neg P) |
| (\rightarrow) | IF … THEN | (P \rightarrow Q) |
| (\leftrightarrow) | IF AND ONLY IF | (P \leftrightarrow Q) |
| (\vdash) | PROVED / TRUE | (S \vdash C) |
Useful Inference Rules
| Rule | Condition | Result |
|---|---|---|
| Modus Ponens | (P), (P \rightarrow Q) | (Q) |
| Modus Tollens | (\neg Q), (P \rightarrow Q) | (\neg P) |
| Disjunctive Syllogism | (P \lor Q), (\neg P) | (Q) |
| Hypothetical Syllogism | (P \rightarrow Q), (Q \rightarrow R) | (P \rightarrow R) |
| Conjunction Introduction | (P), (Q) | (P \land Q) |
| Conjunction Elimination | (P \land Q) | (P) or (Q) |
| Addition | (P) | (P \lor Q) |
| Simplification | (P \lor Q), (\neg Q) | (P) |
| Resolution | (P \lor Q), (\neg P \lor R) | (Q \lor R) |
Tip: Most SC questions can be solved by direct substitution or contradiction, not by full logical derivation.
3. Step‑by‑Step Strategy
| Step | What to Do | Why |
|---|---|---|
| 1. Read the Statement Carefully | Identify all facts, conditions, and logical connectives. | The statement may contain nested clauses that change the meaning. |
| 2. Translate into Symbolic Logic | Convert the statement into a formal expression using the symbols above. | Symbolic form removes ambiguity and lets you apply inference rules systematically. |
| 3. Examine the Conclusion | Look for the logical relationship: is it a consequence, a contradiction, or independent? | This determines the answer type (true/false/possible/undecidable). |
| 4. Apply Inference Rules | Use Modus Ponens, Modus Tollens, etc., to derive the conclusion, or try to derive its negation. | If you can derive the conclusion, it is true; if you can derive its negation, it is false. |
| 5. Check for Contradiction | Assume the conclusion is true, see if it contradicts the statement. | If contradiction arises, conclusion is false. |
| 6. Test Both Possibilities | If neither the conclusion nor its negation can be derived, it’s possible or undecidable. | Distinguish possible (both (C) and (\neg C) are consistent) from undecidable (neither can be decided). |
| 7. Choose the Correct Option | Match the outcome with one of the four answer choices. | Done! |
4. Common Pitfalls & Tricky Points
| Pitfall | What Went Wrong | How to Fix |
|---|---|---|
| Misreading “either … or” | Thinking it’s exclusive OR (XOR) when it’s inclusive OR. | Look for words like “but only” or “and” after “either”. |
| Forgetting Negations | Negating the wrong part of a statement (e.g., (\neg(P \land Q)) vs (\neg P \land \neg Q)). | Apply De Morgan’s laws carefully. |
| Assuming Universal Quantifiers | Treating “all” as “some” or vice versa. | Check if the statement talks about every object or at least one. |