3.3 Verbal Deductive Logic & Syllogisms

3.3 Verbal Deductive Logic & Syllogisms

At a Glance: Deductive reasoning tests your capacity to derive logically necessary conclusions from given premises without falling into real-world assumption traps. Unlike everyday conversation where plausible inferences suffice, formal deductive validity requires absolute mathematical certainty: if the premises are true, the conclusion must be impossible to falsify. Mastering Euler circles, linear ranking chains, and truth-teller hypothesis testing ensures total accuracy under strict exam conditions.

---

The Nature of Deductive Logic in Verbal Reasoning

In standard verbal comprehension, readers use general knowledge and context to infer likely outcomes. In formal verbal deductive logic, however, the rules of engagement are strictly mathematical.

The Iron Law of Deductive Validity

A conclusion is deductively valid if and only if it is impossible for the premises to be true while the conclusion is false. If there is even one conceivable scenario where all premises hold true but the conclusion fails, that conclusion is invalid.

Empirical Truth vs. Deductive Validity

Selective entrance examiners frequently write logic questions using absurd or counter-factual statements to test whether candidates can separate logical structure from real-world common sense.

Consider this syllogism:

• Premise 1: All kangaroos have wings.
• Premise 2: All winged creatures are reptiles.
• Conclusion: Therefore, all kangaroos are reptiles.

In the real world, this statement is factually absurd: kangaroos do not have wings, and they are mammals. However, in formal deductive logic, the argument is 100% valid. If you accept the premises as true, the conclusion must follow with absolute necessity. You must accept every premise inside the question as unquestionable truth.

---

Categorical Syllogisms & Quantifier Mechanics

Categorical syllogisms are built upon four fundamental logical quantifiers that define the relationships between sets of entities:

1. Universal Affirmative ("All A are B"): Every single member of Set A is contained within Set B ($A \subseteq B$).
2. Universal Negative ("No A are B"): Sets A and B are completely disjoint; they share zero members ($A \cap B = \emptyset$).
3. Particular Affirmative ("Some A are B"): At least one member of Set A is also a member of Set B ($A \cap B \neq \emptyset$).
4. Particular Negative ("Some A are not B"): At least one member of Set A lies outside Set B ($A \setminus B \neq \emptyset$).

The Logical Meaning of "Some"

In casual conversation, when someone says "Some students passed the exam," people routinely assume that some students failed. In formal deductive logic, this assumption is false.

Common Syllogistic Fallacies to Avoid

Examiners design incorrect options around predictable logical flaws:

• The Converse Fallacy (Illicit Conversion):
  • Fallacy: Assuming that "All A are B" means "All B are A".
  • Example: "All sharks are fish" does not imply that "All fish are sharks".
• The Undistributed Middle Fallacy:
  • Fallacy: Connecting two categories simply because they both relate to a common third category.
  • Example: "All apples are fruit. All oranges are fruit. Therefore, all apples are oranges." (Invalid! Both sets reside inside 'fruit', but they do not intersect).
• The False Transposition of 'Some':
  • Fallacy: Inferring that because "Some A are B" and "Some B are C", therefore "Some A are C".
  • Example: "Some doctors are runners. Some runners are teenagers." It is entirely possible that the runners who are doctors are all 40 years old, sharing zero overlap with the teenage runners.

---

Diagrammatic Logic: Euler Circles & Venn Testing

The most reliable technique for solving categorical syllogisms under exam pressure is the Euler Circle method. By sketching categories as circles, you can visually test whether a conclusion is unavoidable or merely optional.

The Counter-Example Rule

To determine if a syllogistic conclusion is valid, attempt to draw a counter-example: a configuration where both premises remain completely true, but the proposed conclusion is clearly false. If you can sketch even one valid counter-example, the conclusion is invalid.

Worked Walkthrough: Testing a Syllogism

Given Premises:

1. All architects are designers. (Circle Architects is drawn entirely inside Circle Designers).
2. Some designers are sculptors. (Circle Sculptors must overlap Circle Designers by at least one member).

Evaluate Conclusion 1: "Some architects are sculptors."

• Test: Can we draw Circle Sculptors so that it overlaps Circle Designers without touching Circle Architects?
• Result: Yes! Circle Sculptors can intersect Circle Designers exclusively in the outer ring, completely avoiding Circle Architects.
• Verdict: Because a counter-example exists, Conclusion 1 is INVALID (it could be true, but it is not necessarily true).

Evaluate Conclusion 2: "Some sculptors are designers."

• Test: Can we draw Circle Sculptors overlapping Circle Designers without some sculptors being designers?
• Result: No. The premise explicitly establishes that the two circles share common members. Therefore, the intersection is non-empty from both directions.
• Verdict: Conclusion 2 is VALID.

---

Linear Ordering & Relative Positioning

Linear logic problems present fragmented positional relationships among 5 to 7 entities (e.g. running race finishers, heights, test scores, or seated students). Candidates must deduce the exact ranking or identify an extreme value.

The Inequality Chaining Strategy

1. Convert Text to Mathematical Inequalities: Represent comparative statements using greater-than ($>$) or less-than ($<$) signs.
2. Identify Absolute Anchors: Look for statements specifying extreme ends ("Liam did not finish last", "Sarah is the tallest") or fixed positions ("Ethan sits in the exact middle").
3. Merge Partial Sub-Chains: Link overlapping variables transitively ($A > B$ and $B > C \implies A > B > C$).
4. Isolate Constrained Variables: If an entity has multiple possible positions, test the constraints to see which position avoids contradictions.

Worked Example: Race Finish Order

Problem: Five students—Aiden, Blake, Callum, Dylan, and Ethan—competed in a sprint.

• Callum finished ahead of Dylan: $C > D$
• Dylan finished ahead of Aiden: $D > A$
• Aiden finished ahead of Blake: $A > B$
• Ethan was neither the first nor the last runner to finish.

Who definitely finished in last place?

Step 1: Build the transitive chain. Linking the first three direct clues gives: $C > D > A > B$ This establishes a strict sequence of 4 runners: Callum (1st relative), Dylan (2nd relative), Aiden (3rd relative), Blake (4th relative).

Step 2: Place the unlinked variable (Ethan).

• Ethan ($E$) must be slotted into this 4-person chain to create a 5-person finish.
• Ethan cannot be first ($E \neq 1$).
• Ethan cannot be last ($E \neq 5$).
• If Ethan were placed behind Blake ($C > D > A > B > E$), Ethan would be 5th (last), which directly violates the rule.
• Therefore, Ethan must be placed somewhere ahead of Blake (e.g. between Callum and Dylan, Dylan and Aiden, or Aiden and Blake).
• In every allowable placement, Blake is forced into 5th place (last).

Answer: Blake definitely finished in last place.

---

Truth-Teller and Liar Logic Puzzles

Truth-teller dilemmas present several characters making assertions about who is guilty, who holds an object, or who tells the truth. Typically, the question specifies that "exactly one person tells the truth" or "exactly one person is lying".

The Hypothesis Testing Protocol

Never guess randomly. Execute a structured hypothesis test:

1. Locate Direct Contradictions: If Person A asserts "The key is in Box 1" and Person B asserts "The key is not in Box 1", their statements are contradictory. Exactly one must be telling the truth, and exactly one must be lying.
2. Exploit the Solitary Constraint: If the problem states that "only one person tells the truth", that lone truth-teller must be one of the two contradicting speakers! All other individuals are automatically proven to be liars.
3. Assume and Verify: Assume Person A is truthful; check if any contradictions emerge. If an impossibility arises, Person A is the liar and Person B is truthful.

Worked Example: The Stolen Trophy

Problem: Three students—Liam, Mia, and Noah—are questioned about who took the class trophy. Exactly one student tells the truth, and exactly one student took the trophy.

• Liam: "Mia did not take the trophy."
• Mia: "Noah took the trophy."
• Noah: "I did not take the trophy."

Who took the class trophy?

Step 1: Identify the contradiction.

• Mia says: "Noah took it."
• Noah says: "I did not take it."
• These two statements cannot both be true, nor can they both be false. Exactly one of them is telling the truth, and the other is lying.

Step 2: Deduce Liam's status.

• The question guarantees that exactly one of the three students tells the truth.
• Since that single truthful statement belongs either to Mia or to Noah, Liam must be lying!

Step 3: Invert Liam's lie to reveal the truth.

• Liam's statement: "Mia did not take the trophy" is a lie (FALSE).
• The negation of his statement is the absolute truth: Mia DID take the trophy.

Verification: If Mia took the trophy, then Mia's statement ("Noah took it") is false. Noah's statement ("I did not take it") is true. There is exactly one truth-teller (Noah) and exactly one trophy-taker (Mia). The solution is airtight in under 20 seconds.

---

Eliminating Assumption Traps: Necessary vs. Plausible

In competitive exams, examiners intentionally write incorrect options that appeal to common sense. To protect your score, categorize every multiple-choice statement into one of three buckets:

1. Must Be True (Deductively Guaranteed): The only acceptable answer in deductive reasoning questions. Proven with 100% certainty by the premises.
2. Could Be True (Plausible Distractor): A statement that is realistic or possible, but for which the premises do not provide conclusive proof. In deductive reasoning, "Could Be True" equals WRONG.
3. Must Be False (Contradiction): A statement that directly conflicts with the premises.