Statement & conclusion

Logical Reasoning · free study notes

Statement & Conclusion – Advanced Reasoning Ability Notes

(For Arunachal Pradesh Patwari / Lekhpal – Reasoning Ability Section)

Why Study “Statement & Conclusion” (S&C) at an MIT‑level?

  • S&C is the backbone of many logical reasoning tests.
  • Mastery of S&C means you can solve any deductive–inductive question in minutes.
  • The techniques overlap with propositional logic, set theory, and predicate calculus – all core areas in computer science, mathematics, and philosophy.

1. Foundations – From First Principles

Concept Definition Symbolic Form Key Points
Statement A declarative sentence that is truth‑valued (True or False). S Only statements are considered; questions, commands, or queries are excluded.
Conclusion A statement that is inferred from one or more premises (statements). C Must be logically entailed by the premises.
Premise A statement that is accepted as true for the purpose of reasoning. P₁, P₂, … Premises can be given explicitly or implicitly.
Entailment P₁, P₂, … ⊨ C means every interpretation making all Pᵢ true also makes C true. Equivalent to ¬(P₁ ∧ P₂ ∧ … ∧ ¬C) being a tautology.
Logical Connectives ∧ (and), ∨ (or), ¬ (not), → (implies), ↔ (if and only if) Build complex statements.

1.1 Truth‑Value Tables (T‑Tables)

A truth table enumerates all possible truth assignments to the variables and shows the resulting truth value of a compound statement.

Example

P Q P → Q ¬P ∨ Q
T T T T
T F F F
F T T T
F F T T
  • P → Q is equivalent to ¬P ∨ Q.
  • A tautology is a statement that is always true (e.g., P ∨ ¬P).
  • A contradiction is always false (e.g., P ∧ ¬P).

1.2 Formal Inference Rules

Rule Notation Example
Modus Ponens P → Q, P ⊢ Q From If it rains, then the ground is wet and It rains, deduce The ground is wet.
Modus Tollens P → Q, ¬Q ⊢ ¬P From If it rains, then the ground is wet and The ground is not wet, deduce It did not rain.
Hypothetical Syllogism P → Q, Q → R ⊢ P → R
Disjunctive Syllogism P ∨ Q, ¬P ⊢ Q
Constructive Dilemma (P → Q) ∧ (R → S), P ∨ R ⊢ Q ∨ S

Theorem (Soundness & Completeness)
A set of premises entails a conclusion iff the conclusion can be derived using the above inference rules (within propositional logic).


2. “Statement & Conclusion” in Reasoning Tests

Typical pattern:

  1. Premises (Statements) are given.
  2. One or more Conclusions are offered as options.
  3. Select the conclusion that logically follows from all premises.

2.1 Common Mistakes

Mistake Why It Happens Fix
Treating “All A are B” as “Some A are B” Confusing universal with existential quantifiers Remember: “All A are B” → ∀x (A(x) → B(x)).
Assuming “If A then B” is equivalent to “If B then A” Neglecting asymmetry of implication Check direction of implication.
Using “and” where “or” is required (or vice versa) Misreading the connective Look for words like “both … and …” vs “either … or …”.
Overlooking hidden premises Not realizing the question may embed a premise Read carefully; sometimes a statement is implied (e.g., “Since X does Y, it follows that …”).
Ignoring contradictions Assuming all statements are consistent Verify that premises are mutually consistent; if not, no conclusion can be drawn.

2.2 Edge Cases

Edge Case Explanation How to Resolve
Contradictory Premises P and ¬P

Your note

Page 1

Doubt hai is topic me?

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