Unit 2: Syllogism and Number Ranking

I. Foundations of Deductive and Positional Reasoning

Syllogism and ranking tests assess the ability to derive conclusions from stated relationships without adding outside knowledge. Syllogisms concern logical relations among classes, while number-ranking problems determine positions, totals, or intermediate values from ordered information.

• Governing principle: Treat every statement as true for the purpose of the problem, even when it conflicts with real-world knowledge.
• Deductive validity: A conclusion follows only when it is necessarily supported by the premises; plausibility alone is insufficient.
• Class convention: Words such as all, no, and some specify how one category is related to another.
• Existence convention: “Some A are B” guarantees at least one common member, whereas “All A are B” does not by itself guarantee that any A exists.
• Positional convention: Unless stated otherwise, ranks are counted inclusively from the specified end.
• Direction control: Left/right, top/bottom, and ascending/descending order must be identified before applying a formula.
• Verification rule: A result should satisfy every premise or positional condition simultaneously.

II. Syllogistic Reasoning — Relations Among Classes

A. Syllogism

A syllogism is a deductive argument in which two or more premises establish whether a conclusion about classes necessarily follows.

• Basic terms: A categorical statement usually contains a subject class S, a predicate class P, and a quantifier indicating their relationship.
• Four standard forms:
  • Universal affirmative—All S are P: Every member of S belongs to P; therefore, S ⊆ P.
  • Universal negative—No S is P: The classes are disjoint; therefore, S ∩ P = ∅.
  • Particular affirmative—Some S are P: At least one object belongs to both classes; therefore, S ∩ P ≠ ∅.
  • Particular negative—Some S are not P: At least one member of S lies outside P; therefore, S − P ≠ ∅.
• Safe conversions:
  • “No S is P” converts to “No P is S.”
  • “Some S are P” converts to “Some P are S.”
  • “All S are P” does not convert to “All P are S.”
  • “Some S are not P” does not generally convert to “Some P are not S.”
• Transitive inclusion: If all A are B and all B are C, then all A are C.

A ⊆ B and B ⊆ C  ⇒  A ⊆ C

Here, ⊆ means “is a subset of,” and ⇒ means “logically implies.”

• Negative chain: If all A are B and no B is C, then no A is C, because A lies wholly inside a class disjoint from C.
• Worked example: Premises: “All poets are readers” and “No reader is careless.”
  • Since Poets ⊆ Readers and Readers ∩ Careless = ∅, it follows that Poets ∩ Careless = ∅.
  • Therefore, “No poet is careless” follows.
  • “Some readers are poets” does not necessarily follow unless the existence of at least one poet is established.

B. Logical Venn diagrams

Logical Venn diagrams represent classes as regions so that inclusion, exclusion, and partial overlap can be inspected visually.

• Diagram elements:
  • Rectangle: Represents the universal set containing all objects under consideration.
  • Circle or closed region: Represents a class such as students, artists, or vehicles.
  • Overlap: Represents members common to two or more classes.
  • Separated regions: Represent classes having no common members.
• Representation rules:
  • “All A are B” places the A circle entirely inside B.
  • “No A is B” places A and B without overlap.
  • “Some A are B” marks at least one member, often with ×, in A ∩ B.
  • “Some A are not B” places × in the part of A outside B.
• Shading convention: In formal Venn methods, shading indicates an empty region, while × indicates an existing member.
• Three-class analysis: With classes A, B, and C, a mark must be placed only as precisely as the premises permit; an uncertain mark may sit across a boundary.
• Worked example: “All surgeons are doctors; some doctors are musicians.”
  • Draw Surgeons completely inside Doctors.
  • Mark an overlap between Doctors and Musicians.
  • The musician mark need not lie inside Surgeons; therefore, “Some surgeons are musicians” is not forced.

C. Ability to relate a given group diagrammatically

Relating a group diagrammatically means selecting or constructing the arrangement that satisfies all named class relationships at once.

• Translation sequence:
  • Identify each noun class, such as Teachers, Women, and Athletes.
  • Translate each statement into inclusion, exclusion, or overlap.
  • Draw the strongest fixed relation first, particularly complete inclusion or disjointness.
  • Add partial relationships without assuming any unstated connection.
• Common configurations:
  1. Nested groups: “All roses are flowers” requires Roses ⊆ Flowers.
  2. Disjoint groups: “No square is a circle” requires separate regions.
  3. Partial overlap: “Some writers are actors” requires a shared region but leaves both exclusive regions possible.
  4. Mixed relation: “All cats are animals; no cat is a bird” places cats inside animals and outside birds, while animals and birds may still overlap elsewhere.
• Language control: “Only A are B” means all B are A, not all A are B; thus, “Only graduates are eligible” gives Eligible ⊆ Graduates.
• Group identity: “A and B are identical” requires coincident regions, expressed as A = B.
• Validation: Reject a diagram if it adds a compulsory relationship absent from the statements, such as making all doctors teachers when only some doctors are teachers.

D. Possibility-based questions

Possibility-based questions ask whether a proposed relation can exist without contradicting any premise, rather than whether it must follow.

• Core distinction:
  1. Definite conclusion: True in every valid arrangement of the premises.
  2. Possible conclusion: True in at least one valid arrangement and prohibited by none.
• Possibility rule: A statement is possible when its addition leaves the complete class model logically consistent.
• Contradiction checks:
  • If “No A is B” is given, “Some A are B” is impossible.
  • If A ⊆ B, “Some A are not B” is impossible.
  • If no premise fixes the relation between A and C, overlap between them may be possible.
• Reversal of universals: From “All A are B,” it may be possible that some B are A, but this is not a definite conclusion without existence information.
• Worked example: Given “All painters are creative” and “No engineer is a painter,” consider “Some engineers are creative.”
  • Engineers cannot be painters, but the premises do not separate engineers from the wider creative class.
  • An engineer may therefore occupy the creative region outside painters.
  • The proposed conclusion is possible, though not necessary.

III. Number and Ranking Reasoning — Ordered Positions and Quantities

A. Number ranking test

A number ranking test determines total membership, position from the opposite end, or the number of persons between known ranks.

• Opposite-end rank: If a person is Lth from the left in a row of N persons, the rank R from the right is:

R = N - L + 1

Here, N is the total number, L is the left rank, and R is the right rank.

• Total from two ranks: If the same person is Lth from the left and Rth from the right:

N = L + R - 1

The subtraction of 1 prevents the person from being counted twice.

• Persons between two positions: For ranks p and q measured from the same end:

B = |p - q| - 1

Here, B is the number between them, and |p − q| is the absolute positional difference.

• Worked example: Mira is 18th from the left and 25th from the right. The total is 18 + 25 − 1 = 42. If another person is 30th from the left, then 30 − 18 − 1 = 11 persons stand between them.

B. Number test problems

Number test problems use numerical order, comparison, and transformation to identify relative positions or values in a sequence.

• Ordering requirement: Determine whether values are arranged in ascending order, descending order, or according to a stated operation before assigning ranks.
• Rank by value:
  • In descending order, the greatest number has rank 1.
  • In ascending order, the smallest number has rank 1.
• Distinct versus repeated values: Equal values require the ranking convention to be specified; competition ranking may produce 1, 2, 2, 4, while dense ranking gives 1, 2, 2, 3.
• Digit operations: Questions may rank numbers after reversal, digit sum, or another stated transformation; apply the operation before comparing results.
• Worked example: Rank 42, 17, 68, 35, 51 from greatest to least.
  • Ordered list: 68, 51, 42, 35, 17.
  • Therefore, 42 has rank 3.
  • There are two greater values and two smaller values, confirming its central position.

C. Ranking test problems

Ranking test problems convert verbal information about merit, height, age, performance, or position into one consistent ordered arrangement.

• Symbolic translation: “A ranks above B” may be written A > B, where > denotes a higher position rather than necessarily a larger numerical value.
• Chain formation: If A > B, B > C, and C > D, transitivity gives A > B > C > D.
• Incomplete comparisons: From A > B and C > B, the relation between A and C remains unknown.
• Interchange of positions: If two persons exchange places, each acquires the other’s original rank; total membership does not change.
• Tied ranks: Equal standing must not be forced into a strict sequence unless the problem explicitly breaks the tie.
• Worked example: In a class, Kavya ranks above Leena but below Omar; Nitin ranks below Leena. The valid chain is:

Omar > Kavya > Leena > Nitin

Thus, Omar ranks highest and Nitin lowest among the four, while Kavya occupies the second position.

D. Applications and Limitations

Ranking methods are reliable when all positions use a common frame of reference and every statement is interpreted consistently.

• Applications: These methods organize race results, class standings, seating rows, height order, age order, and comparative performance.
• Reference consistency: Ranks from opposite ends require the +1 or −1 adjustment because the identified person is included in both counts.
• Ambiguity limitation: Statements such as “A is near B” or “C performed well” do not establish exact rank.
• Information limitation: Partial chains may identify highest or lowest members without determining every intermediate position.
• Final check: Confirm the direction, count inclusively, distinguish certainty from possibility, and test the completed order against every original condition.