8.3 Syllogisms, Quantifiers & Venn Logic

8.3 Syllogisms, Quantifiers & Venn Logic

Key Exam Fact: Syllogistic and categorical logic questions test set-theoretic relationships and quantification. The most pervasive trap is the colloquial interpretation of the word "Some." In everyday conversation, saying "Some analysts passed the CFA" implies that "Some analysts did not pass." In formal logic, however, "Some" means "at least one, and potentially all." Misinterpreting quantifiers is the leading source of point deductions in the Logic section.

Categorical logic, formalised originally by Aristotle and modernized through Boolean algebra, deals with relationships between categories or classes of objects. On the Bocconi Admission Test, categorical syllogisms test whether you can track set containment, disjoint sets, and partial overlaps under strict mathematical boundaries.

The Four Standard Categorical Propositions (The A, E, I, O Forms)

Every categorical statement links a Subject term ($S$) and a Predicate term ($P$). Categorical logic divides all statements into four standard forms based on Quantity (Universal vs. Particular) and Quality (Affirmative vs. Negative):

The Strict Formal Meaning of "Some"

To excel on the Bocconi test, you must eliminate conversational assumptions regarding quantifiers:

Formal Definition of "Some"

• In formal logic, "Some" = "At least one" (symbolized by the existential quantifier $\exists x$).
• Does "Some $S$ are $P$" mean "Some $S$ are not $P$"? ABSOLUTELY NOT.
• If it is true that "All Bocconi students are mathematically proficient," then the statement "Some Bocconi students are mathematically proficient" is 100% TRUE.
• You can NEVER infer an O-statement ("Some are not") from an I-statement ("Some are"). If an exam question tells you "Some hedge funds use quantitative algorithms," it is entirely possible that every single hedge fund on Earth uses quantitative algorithms.

Summary of Key Quantifier Values

• "All" ($100%$): Every single member of $S$ belongs to $P$.
• "No / None" ($0%$): Zero members of $S$ belong to $P$.
• "Some" ($1% \text{ to } 100%$): At least one member belongs to $P$ (possibly all).
• "Most" ($> 50%$): More than half of the members belong to $P$.

The Square of Opposition & Negating Quantified Statements

The classical Square of Opposition governs the logical relationships between A, E, I, and O propositions. The most critical relationship tested on the Bocconi exam is the Contradictory relationship (strict logical negation):

   Universal Affirmative (A) ---------------- Universal Negative (E)
       "All S are P"                             "No S are P"
            \                                         /
             \               CONTRADICTORIES         /
              \             (Strict Negations)      /
               \                                   /
                \                                 /
                 \                               /
   Particular Affirmative (I) --------------- Particular Negative (O)
      "Some S are P"                           "Some S are not P"

The Contradictory Pairs (Exact Negations)

Two statements are contradictories if they always have opposite truth values: one must be True and the other must be False.

1. The Negation of Universal Affirmative (A) is Particular Negative (O): $\neg(\text{"All } S \text{ are } P\text{"}) \equiv \text{"Some } S \text{ are not } P\text{"}$

   • Exam Trap: Many candidates believe the negation of "All economists agree" is "No economists agree." This is an overstatement fallacy. To disprove the assertion that all economists agree, you do not need universal disagreement; you only need to find a single economist who disagrees ("Some economists do not agree").

2. The Negation of Universal Negative (E) is Particular Affirmative (I): $\neg(\text{"No } S \text{ are } P\text{"}) \equiv \text{"Some } S \text{ are } P\text{"}$

   • To disprove "No portfolio managers beat the market index," you only need a single manager who beats the index: "Some portfolio managers beat the market index."

Testing Syllogistic Validity via Venn Diagrams

A categorical syllogism consists of three categorical propositions:

1. A Major Premise (linking the Major Term $P$ and Middle Term $M$)
2. A Minor Premise (linking the Minor Term $S$ and Middle Term $M$)
3. A Conclusion (linking $S$ and $P$)

The 3-Circle Venn Diagram Technique

To test whether a conclusion follows with deductive necessity, draw three overlapping circles representing $S$ (Minor Term, bottom-left), $P$ (Major Term, bottom-right), and $M$ (Middle Term, top-center).

                    [ Middle Term: M ]
                          /   \
                         /  1  \
                        /       \
                       / 2  3  4 \
                      /           \
     [ Minor Term: S ] ----------- [ Major Term: P ]
           \    5   /       6       \   7    /
            \      /                 \      /
             \____/                   \____/

Diagramming Rules

1. Diagram Universal Premises First (A and E):
   • Universal statements make assertions about emptiness. Shade out regions that are declared to contain zero elements.
   • If "All $M$ are $P$," shade out all regions of $M$ that lie outside $P$ (regions 1 and 2).
   • If "No $S$ are $M$," shade out the entire intersection of $S$ and $M$ (regions 2 and 3).
2. Diagram Particular Premises Second (I and O):
   • Particular statements assert the existence of at least one entity. Place an $X$ in the appropriate region.
   • The Boundary Line Rule: If a premise dictates that an entity exists in a region that is divided into two sub-regions, and neither universal premise has shaded either sub-region out, you must place the $X$ directly on the dividing line between the two sub-regions. An $X$ on a line means the entity could be in either sub-region; it does not guarantee presence in either specific one!
3. Read the Conclusion from the Diagram:
   • NEVER diagram the conclusion!
   • Inspect the diagram after plotting only the premises. If the conclusion is already visually guaranteed by the shading or unambiguous $X$ placement, the syllogism is Deductively Valid.
   • If the conclusion is not forced—even if it seems plausible or consistent—the syllogism is INVALID.

Term Distribution & The Rules of Valid Syllogisms

In categorical logic, a term is said to be distributed if the proposition refers to all individual members of the class designated by that term.

Distribution Table for Categorical Forms

The Fundamental Syllogistic Fallacies

Using term distribution, you can spot invalid arguments instantly without even drawing a Venn diagram:

1. Fallacy of the Undistributed Middle:

   • Rule: The middle term $M$ must be distributed in at least one premise.
   • Why: If the middle term is never distributed, the subject $S$ and predicate $P$ might each overlap with different, non-intersecting subsets of $M$.
   • Example: "All hedge fund analysts ($S$) are finance graduates ($M$). All private equity associates ($P$) are finance graduates ($M$). Therefore, all hedge fund analysts are private equity associates." (Invalid! $M$ is undistributed in both A-statements).

2. Fallacy of Illicit Major:

   • Rule: If the major term $P$ is distributed in the conclusion, it must be distributed in the major premise.
   • Example: "All venture capitalists ($M$) are risk-tolerant ($P$). No municipal bond traders ($S$) are venture capitalists ($M$). Therefore, no municipal bond traders are risk-tolerant." (Invalid! "Risk-tolerant" is distributed in the negative conclusion, but undistributed in the affirmative premise).

3. Fallacy of Exclusive Premises:

   • Rule: No valid conclusion can be drawn from two negative premises (E or O). Two exclusions provide zero linkage between $S$ and $P$.

The Method of Counterexamples

To prove an argument form invalid in under 30 seconds during the Bocconi exam, substitute familiar real-world categories into the exact same logical skeleton to expose the invalidity:

• Argument: "Some mathematicians are philosophers. Some philosophers are poets. Therefore, some mathematicians are poets."
• Formal Skeleton: Some $A$ are $B$. Some $B$ are $C$. $\therefore$ Some $A$ are $C$.
• Counterexample Substitution:
  • Let $A$ = Dogs.
  • Let $B$ = Animals.
  • Let $C$ = Cats.
  • Premise 1: Some dogs are animals. (True)
  • Premise 2: Some animals are cats. (True)
  • Conclusion: Some dogs are cats. (False!)

Because the counterexample uses the exact same argument structure and yields true premises with a demonstrably false conclusion, the argument structure is formally invalid.

Worked Bocconi Exam Scenario: Multi-Premise Categorical Deduction

Problem: Consider the following three statements regarding professionals at a global investment bank:

1. "All quantitative researchers are advanced Python programmers."
2. "Some quantitative researchers are registered financial analysts."
3. "No advanced Python programmers are technologically illiterate."

Which of the following statements MUST be true?

Step 1: Formalize Terms and Premises

• Let $Q$ = Quantitative researchers.

• Let $P$ = Advanced Python programmers.

• Let $R$ = Registered financial analysts.

• Let $T$ = Technologically illiterate individuals.

• Premise 1 (A-form): All $Q$ are $P$ ($Q \subseteq P$).

• Premise 2 (I-form): Some $Q$ are $R$ ($Q \cap R \neq \emptyset$).

• Premise 3 (E-form): No $P$ are $T$ ($P \cap T = \emptyset$).

Step 2: Step-by-Step Set Containment Deduction

• From Premise 2, there exists at least one individual, let us call them $k$, such that $k \in Q$ and $k \in R$.
• From Premise 1, since $k \in Q$, and all $Q$ belong to $P$, it necessarily follows that $k \in P$.
• Therefore, $k$ is simultaneously an element of $R$ and $P$. This proves definitively that $R \cap P \neq \emptyset$ ("Some registered financial analysts are advanced Python programmers").
• Now link with Premise 3: No $P$ is $T$ ($P$ and $T$ are completely disjoint). Since $k \in P$, $k$ cannot possibly be in $T$.
• Since $k \in R$ and $k \notin T$, this proves that there is at least one member of $R$ who is not in $T$: "Some registered financial analysts are not technologically illiterate" ($R \cap T^c \neq \emptyset$, an O-proposition).

Notice how we systematically derived a valid I-proposition and a valid O-proposition without guessing, proving the immense power of formal quantifier tracking under timed exam pressure.