Unit 3: Syllogism and Blood Relation

I. Orientation — Principles of Relational Reasoning

Syllogism and blood-relation problems test the ability to derive necessary conclusions from stated information. Syllogisms concern relationships among classes or categories, while blood-relation problems concern relationships among people. In both, everyday assumptions must be excluded: only the information given, together with logically necessary implications, may be used.

• Governing principle: A conclusion is valid only when it follows necessarily from the premises; a conclusion that is merely likely is not valid.
• Representation: Syllogisms are represented through sets and Venn diagrams, whereas family relationships are represented through family trees, generation levels, and gender markers.
• Direction: Relations must be read in the stated direction. If A is B’s father, then B is A’s son or daughter, depending on B’s gender.
• Converse restriction: A statement does not normally establish its converse. From “All A are B,” it does not follow that “All B are A.”
• Existence convention: Universal statements such as “All A are B” do not, by themselves, guarantee that any A exists. Particular statements such as “Some A are B” do establish existence.
• Possibility standard: A possible conclusion needs at least one arrangement consistent with all premises; a definite conclusion must hold in every valid arrangement.
• Symbolic discipline: Names, occupations, and familiar social patterns carry no extra information unless explicitly defined.
• Consistency: Every inferred relation must agree with all premises simultaneously. One contradictory link invalidates the proposed arrangement.

II. Syllogism — Reasoning About Classes and Categories

A. Logical Venn diagrams

Logical Venn diagrams translate categorical statements into spatial relationships among sets, making inclusion, overlap, and exclusion visible.

• Universal affirmative: “All A are B” means set A lies entirely inside set B.
  

  TEXT

    A ⊆ B

  
  Here, A and B are sets, and ⊆ means “is a subset of.” Nothing proves that all B are A.

• Universal negative: “No A is B” means the two sets are disjoint.
  

  TEXT

    A ∩ B = ∅

  
  The symbol ∩ denotes intersection, while ∅ denotes an empty set.

• Particular affirmative: “Some A are B” requires at least one element in the intersection.
  

  TEXT

    A ∩ B ≠ ∅

  
  “Some” means one or more, not necessarily only some; all A could still be B.

• Particular negative: “Some A are not B” places at least one member of A outside B.
  

  TEXT

    A \ B ≠ ∅

  
  The expression A \ B means members belonging to A but not to B.

• Complementary language: “Only A are B” means every B is A, so B ⊆ A. The word immediately following “only” names the larger containing class.

• Worked example: Consider “All poets are readers,” “No reader is careless,” and “Some poets exist.”

  • Let P, R, and C represent poets, readers, and careless people.
  • The premises give P ⊆ R, R ∩ C = ∅, and P ≠ ∅.
  • Therefore, P ∩ C = ∅; no poet is careless.
  • Because poets explicitly exist, “Some readers are not careless” also follows.

B. Relating a given group diagrammatically

Relating a group diagrammatically means combining several premises into one consistent set model before evaluating conclusions.

• Translation sequence: Convert each sentence separately, beginning with the strongest restrictions: disjointness, complete inclusion, and then partial overlap.

• Inclusion chain: If all A are B and all B are C, then every A must be C.
  

  TEXT

    A ⊆ B and B ⊆ C  ⇒  A ⊆ C

  
  This is transitive inclusion; its reverse remains unproved.

• Exclusion transfer: If A ⊆ B and B ∩ C = ∅, then A ∩ C = ∅. A subset cannot meet a class excluded from its containing set.

• Partial-overlap limit: From “Some A are B” and “Some B are C,” no relation between A and C necessarily follows. The two groups of B-members may be different.

• Shared-container limit: If all A are C and all B are C, A and B may overlap or remain separate inside C. Common membership in a larger set does not prove mutual contact.

• Existential propagation: If some A are B and all B are C, then some A are C because the known A–B member must also belong to C.

• Diagram construction:

  1. Draw the containing set for each universal affirmative.
  2. Separate classes linked by a universal negative.
  3. Mark particular members with an x in the required region.
  4. Keep unspecified regions flexible rather than forcing overlap or separation.

C. Possibility questions

Possibility questions ask whether a proposed relationship can occur without contradicting the premises, rather than whether it must occur.

• Existential criterion: A possibility is accepted when at least one valid Venn arrangement satisfies both the premises and the proposed conclusion.

• Contradiction criterion: “Some A are B is possible” fails only when the premises force A ∩ B = ∅; absence of a proven overlap does not make overlap impossible.

• Definite versus possible:

  1. Definite conclusion: True in every arrangement allowed by the premises.
  2. Possible conclusion: True in at least one allowed arrangement, though false in others.

• Universal possibility: “All A being B is possible” requires that no premise forces any A outside B. A statement such as “Some A are not B” directly blocks it.

• Existence caution: If no premise establishes A’s existence, an empty A may technically satisfy “All A are B.” In aptitude-test conventions, wording and stated existence conditions should be applied consistently.

• Worked example: Suppose all musicians are artists and some teachers are artists.

  • M ⊆ A and T ∩ A ≠ ∅, where M, A, and T denote musicians, artists, and teachers.
  • Some teachers being musicians is possible because the teacher–artist members may lie inside M.
  • It is not definite because those members may instead occupy the part of A outside M.
  • No teacher being a musician is also possible; neither premise forces an intersection.

D. Applications and limitations

Syllogistic analysis is reliable only when categorical language and logical scope are handled precisely.

• Useful applications: It supports classification, rule checking, database filtering, legal reasoning, and evaluation of category-based arguments.
• Quantifier sensitivity: “All,” “no,” and “some” have different logical force; replacing one with another changes the diagram.
• Illicit conversion: From “All doctors are graduates,” “All graduates are doctors” cannot be inferred.
• Existential fallacy: “All engineers are trained” does not alone prove “Some trained people are engineers.”
• Negative-chain limit: From “No A is B” and “No B is C,” no fixed relation follows between A and C.
• Best control method: Test a conclusion against both a model where it holds and a model where it fails. If both models satisfy the premises, the conclusion is possible but not definite.

III. Blood Relation — Reconstructing Kinship Networks

A. Cracking jumbled-up descriptions

Cracking jumbled-up descriptions requires converting scattered verbal clues into a structured family tree while preserving generation, gender, and direction.

• Reference point: Begin with the person connected by the clearest relation, then attach other people one statement at a time.

• Generation levels:

  • Grandparents occupy level +2.
  • Parents, uncles, and aunts occupy level +1.
  • The reference person, siblings, spouses, and cousins occupy level 0.
  • Children occupy level −1, and grandchildren occupy level −2.

• Gender markers: Record male or female only when established by words such as father, daughter, brother, or wife. “Child,” “sibling,” and “cousin” do not establish gender.

• Possessive direction: In “P is the mother of Q,” P is one generation above Q. Reversing the sentence changes the relation to “Q is P’s child.”

• Pronoun control: Resolve “he,” “she,” “his,” and “her” against grammatically valid antecedents before drawing links.

• Spouse placement: Spouses normally occupy the same generation and connect through marriage, not descent.

• Worked example: “R is the sister of S. S is the father of T. U is R’s mother.”

  • R and S share a generation and are siblings.
  • T is one generation below S.
  • U is one generation above R and, under the ordinary full-sibling interpretation, also S’s mother.
  • R is therefore T’s paternal aunt, while U is T’s paternal grandmother.

B. Relation puzzles

Relation puzzles combine several kinship facts and require the shortest valid relationship between two specified people.

• Tree method: Use horizontal lines for marriage, branching lines for children, and aligned levels for members of the same generation.
• Path method: Trace from the first person to the nearest common ancestor and then down to the second person; translate each movement into kinship language.
• Sibling relations: Two people sharing parentage are siblings; their gender determines brother or sister.
• Collateral relations: A parent’s brother is an uncle, a parent’s sister is an aunt, and their children are cousins of the reference person.
• Nephew and niece: A sibling’s son is a nephew; a sibling’s daughter is a niece. The same terms apply to a spouse’s sibling’s children in common usage, so puzzle conventions matter.
• Maternal and paternal distinction: Mother’s relatives are maternal; father’s relatives are paternal. Thus, a mother’s father is the maternal grandfather.
• Marriage versus blood: A brother-in-law may mean a spouse’s brother or a sibling’s husband. The tree, rather than the label alone, determines the exact connection.
• Constraint checking: Counts such as “two sons” or “only daughter” restrict possible identities. “Only daughter” excludes another female child but does not exclude sons.
• Ambiguity rule: If gender, parentage, or marriage is not fixed, the answer should remain at the most specific relation logically established, such as “sibling” rather than “brother.”

C. Coded relations

Coded relations replace ordinary kinship expressions with symbols, requiring each code to be decoded before relations are combined.

• Code definition: A symbol has no standard meaning. For example, if A + B means “A is the mother of B,” the plus sign carries that exact meaning only within the given code.

• Operand order: The positions around the operator are essential. If A × B means “A is B’s brother,” then B × A would mean “B is A’s brother,” provided B is male; it is not automatically equivalent.

• Decoding procedure:

  1. Rewrite every coded expression as a complete sentence.
  2. Mark gender and generation changes.
  3. Draw the links in sequence.
  4. Read the required relation in the requested direction.

• Generation arithmetic: Parent relations move one level upward, child relations one level downward, and sibling or spouse relations remain on the same level.

• Worked example: Let P @ Q mean “P is the father of Q,” and P # Q mean “P is the sister of Q.” In A @ B # C:

  • A @ B makes A the father of B.
  • B # C makes B the sister of C, so B is female and B and C are siblings.
  • Under the standard shared-parent convention, A is also C’s father.
  • C’s gender remains unknown because the code defines only B as female.

D. Applications and limitations

Blood-relation reasoning is effective when family structure is made explicit and unstated assumptions are controlled.

• Applications: The method supports pedigree interpretation, genealogy, inheritance reasoning, and identity-link analysis.
• Structural limitation: Terms such as sibling may include full, half, adoptive, or step relationships in real life, while aptitude problems usually use a simplified family model.
• Gender limitation: A relation may identify generation without identifying gender; “parent’s child” establishes a sibling relation but not brother or sister.
• Marriage limitation: Kinship by marriage must not be treated as biological descent unless another premise supplies that link.
• Validation: The final tree should satisfy every clue, preserve all stated genders, respect generation levels, and avoid assigning two incompatible roles to one person.