Logical Reasoning – Analogy & Classification
(NSO – Science Olympiad, IIT‑JEE / Competitive‑Exam Level)
Goal of this chapter
Master the art of analogy and classification – two core sub‑skills in logical reasoning.
Learn how to formalise analogies, dissect classification problems, and spot the subtle traps that often appear in competitive exams.
1. Analogy
1.1 What is an Analogy?
An analogy is a comparison that shows a relation R between a pair of objects A and B, and asks for a pair C and D that share the same relation.
Formally
A R B ⇔ C R D
Where
Rmay be “is to”, “is the function of”, “is the opposite of”, etc.
1.2 Types of Analogies
| Type | Description | Example |
|---|---|---|
| Simple (Two‑word) | One-to-one mapping of attributes. | Book : Reading :: Apple : Eating |
| Extended (Multi‑word) | More than two words per side; often involve phrases, sentences, or short paragraphs. | “The cat chased the mouse.” : “The dog chased the …” |
| Conceptual | Relates abstract concepts or categories. | “Knowledge : Wisdom :: Information : Data” |
| Functional | Relates a tool to its use. | “Pen : Writing :: Brush : Painting” |
1.3 Formalizing Analogies
Let’s treat the relation R as a function f:
f(A) = B
f(C) = ?
If we can deduce f, then f(C) gives the missing element.
In many exam problems, f is implicit: we must infer the attribute(s) that bind A and B.
1.3.1 Logical Equivalence
An analogy can be expressed as a logical equivalence:
(A ∧ R ∧ B) ⇔ (C ∧ R ∧ D)
Where ∧ is the logical AND.
If R is transitive, we can chain analogies:
A R B, B R C ⇒ A R C.
Caution: Transitivity does not hold for all relations (e.g., “is the opposite of”).
1.4 Problem‑Solving Strategy
| Step | Action | Why it matters |
|---|---|---|
| 1. Identify the relation | Note the verb or preposition connecting the pair. | Gives a hint on the attribute (function, property, etc.). |
| 2. List attributes | Write down all possible, characteristic attributes of each element. | Helps to match the common attribute. |
| 3. Check for multiple attributes | Some analogies involve two or more attributes (e.g., size & color). | Prevent mis‑matching. |
| 4. Test the candidate | Replace the missing element in the second pair and verify the relation holds. | Confirms correctness. |
| 5. Eliminate distractors | Discard options that break the relation or introduce new attributes. | Reduces answer space. |
1.4.1 Example
SUNG : SUNSET :: MOON : ?
- Relation: “appears at the end of” (sunset = end of sun).
- Candidate: MOON appears at the end of day? No.
Moonrise? Not a sunset.
Answer: MOON : MOONSET (the astronomical term for the moon’s disappearance).
(In many tests, the answer is MOONSET or MOONSET.)
This showcases the importance of conceptual analogies.
2. Classification
2.1 What is Classification?
Classification is the process of grouping objects into categories based on shared attributes.
Mathematical view
A partitionPof a setSis a collection of non‑empty, pairwise disjoint subsets whose union isS.
P = {C₁, C₂, …, Cₙ}
∩ (Cᵢ ∩ Cⱼ) = ∅ for i ≠ j
∪ (Cᵢ) = S
2.2 Types of Classification
| Type | Criteria | Example |
|---|---|---|
| Hierarchical | Single attribute used to create a tree (e.g., Animal → Mammal → Canine). | Biological |