2.3 Complex Multi-Premise Passages & Quantifiers

2.3 Complex Multi-Premise Passages & Quantifiers

As candidates progress through Section 1 of the SAEE, passages become increasingly dense, combining four, five, or more interconnected premises featuring categorical quantifiers. Master-level performance requires rapid set-relationship mapping and fluent calculation of quantifier intersections.

Formal Definitions of Categorical Quantifiers

In everyday conversation, words like "some" or "most" are used casually and ambiguously. On the SAEE, quantifiers possess strict, non-negotiable mathematical definitions:

The Critical "SOME" Rule

In standard English, saying "Some agents completed the course" implies that some agents did not. In formal logic, this implication does NOT exist. "Some" means strictly "at least one." It establishes a lower bound of 1, but sets no upper bound. A passage stating "Some agents completed the course" is mathematically compatible with a scenario where 100% of agents completed the course.

Quantifier Combination & Set Overlap Matrix

When premises with different quantifiers are combined in a multi-premise chain, specific set overlap rules dictate what inferences can be drawn:

+---------------------------------------------------------------------------------------+
|                              QUANTIFIER COMBINATION MATRIX                            |
+-------------------+-------------------+-----------------------+-----------------------+
| Premise 1         | Premise 2         | Valid Combination     | Invalid Fallacy       |
+-------------------+-------------------+-----------------------+-----------------------+
| ALL A are B       | ALL B are C       | ALL A are C           | ALL C are A           |
| ALL A are B       | SOME A are C      | SOME B are C          | SOME B are NOT C      |
| ALL A are B       | NO B are C        | NO A are C            | SOME A are C          |
| MOST A are B      | MOST A are C      | SOME B are C (Overlap)| MOST B are C          |
| SOME A are B      | SOME B are C      | NO VALID INFERENCE    | SOME A are C          |
+-------------------+-------------------+-----------------------+-----------------------+

Key Multi-Premise Deduction Rules:

1. The Universal Transitive Rule: $All\ A \rightarrow B$ AND $All\ B \rightarrow C \implies All\ A \rightarrow C$.
2. Universal + Particular Combination: $All\ A \rightarrow B$ AND $Some\ A \rightarrow C \implies Some\ B \rightarrow C$. Because the $A$'s that are $C$ are contained within $B$, there must be an overlap between $B$ and $C$.
3. The Double-MOST Pigeonhole Overlap: If Premise 1 states "Most $A$ are $B$" ($>50\%$), and Premise 2 states "Most $A$ are $C$" ($>50\%$), then at least some $B$ MUST be $C$. Because two subsets each exceeding 50% of the same total set $A$ cannot exist without intersecting, an overlap is mathematically forced.
4. The Mid-Chain Particular Fallacy: You CANNOT link two "SOME" statements across a middle term. If "Some $A$ are $B$" and "Some $B$ are $C$", there is zero guaranteed overlap between $A$ and $C$. The subset of $B$ that overlaps with $A$ could be completely disjoint from the subset of $B$ that overlaps with $C$.

Visualizing Set Relationships with Euler & Venn Diagrams

When scratch-pad mapping complex passages, sketch simple overlapping circles (Euler diagrams) to track set boundaries:

  NESTED SETS (ALL A are B)         DISJOINT SETS (NO A are B)        INTERSECTING SETS (SOME A are B)
       +---------------+                 +---+   +---+                       +---+---+
       |  B (Outer)    |                 | A |   | B |                       | A | B |
       |   +-------+   |                 +---+   +---+                       |   |   |
       |   | A (In)|   |                                                     +---+---+
       |   +-------+   |               (Zero Overlap)                     (Overlap >= 1)
       +---------------+

Step-by-Step Multi-Premise Walkthrough

Analyze the following 5-premise SAEE passage using systematic set mapping:

Complex Investigative Passage: "All Special Agents assigned to the Cyber Fraud Task Force (CFTF) are certified polygraph examiners. All certified polygraph examiners are trained in advanced interrogation techniques. Most CFTF Special Agents are fluent in Mandarin. No agent trained in advanced interrogation techniques is permitted to conduct unmonitored field interviews without senior supervisor authorization. Agent Liang is assigned to the CFTF."

Premise Isolation & Formal Symbolic Breakdown:

1. $P_1$: $CFTF \subseteq Polygraph\ Examiners$ ($All\ CFTF \rightarrow Poly$)
2. $P_2$: $Polygraph\ Examiners \subseteq Advanced\ Interrogation$ ($All\ Poly \rightarrow Interrogation$)
3. $P_3$: $Most\ CFTF \rightarrow Mandarin\ Fluent$ ($>50\%\ of\ CFTF$)
4. $P_4$: $No\ Interrogation \rightarrow Unmonitored\ Field\ Interview\ (without\ Auth)$
5. $P_5$: $Agent\ Liang \in CFTF$

Step-by-Step Deduction Chain:

• Chain 1 ($P_5 + P_1 + P_2$): Liang is in CFTF ($P_5$). All CFTF are Polygraph Examiners ($P_1$). All Polygraph Examiners are trained in Advanced Interrogation ($P_2$).
  • Deduction A: Agent Liang IS a certified polygraph examiner.
  • Deduction B: Agent Liang IS trained in advanced interrogation techniques.
• Chain 2 (Deduction B + $P_4$): Liang is trained in advanced interrogation. Under $P_4$, no such agent can conduct unmonitored field interviews without senior supervisor authorization.
  • Deduction C: Agent Liang CANNOT conduct unmonitored field interviews without senior supervisor authorization.
• Chain 3 ($P_1 + P_3$): All CFTF are Polygraph Examiners ($P_1$). Most CFTF are fluent in Mandarin ($P_3$).
  • Deduction D: Some certified polygraph examiners are fluent in Mandarin. (Specifically, those CFTF agents who speak Mandarin).

Evaluating Test Conclusion Items:

• Item 1: "Agent Liang cannot conduct unmonitored field interviews unless senior supervisor authorization is obtained."
  • Result: TRUE (Proven by Deduction C).
• Item 2: "Some certified polygraph examiners are fluent in Mandarin."
  • Result: TRUE (Proven by Deduction D).
• Item 3: "Agent Liang is fluent in Mandarin."
  • Result: CANNOT BE DETERMINED. While most CFTF agents speak Mandarin, we do not know if Liang belongs to the $>50\%$ Mandarin-speaking majority or the $<50\%$ non-Mandarin minority.
• Item 4: "All agents fluent in Mandarin are assigned to the CFTF."
  • Result: CANNOT BE DETERMINED (Classic converse trap; passage asserts CFTF $\rightarrow$ Mandarin for most, but sets no bound on outside Mandarin speakers).