Study guide

2.3 Quantifiers & Formal Logic Sets

Law School Admission Test Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: LSAT Overview, Scoring & Post-2024 Format

1.1 LSAT Exam Format & Logistics 1.2 The Post-2024 Exam Structure 1.3 Strategic Time Management & Pacing

2 Chapter 2: Foundations of Formal Logic & Argument Architecture

2.1 Argument Anatomy: Premises, Conclusions & Assumptions 2.2 Conditional Logic & Contrapositives 2.3 Quantifiers & Formal Logic Sets

3 Chapter 3: Logical Reasoning — Assumptions & Formal Flaws

3.1 Necessary Assumption Questions 3.2 Sufficient Assumption Questions 3.3 Structural & Formal Logic Flaws

4 Chapter 4: Logical Reasoning — Fallacies, Causal Reasoning & Equivocation

4.1 Causal Reasoning & Causation Fallacies 4.2 Sampling, Survey & Statistical Flaws 4.3 Scope Shifts, Equivocation & Ad Hominem

5 Chapter 5: Logical Reasoning — Strengthen, Weaken & Paradox

5.1 Strengthen Questions 5.2 Weaken Questions 5.3 Paradox & Resolve Questions

6 Chapter 6: Logical Reasoning — Inference & Principles

6.1 Must Be True / Strict Inference Questions 6.2 Most Strongly Supported Questions 6.3 Principle Identification & Application

7 Chapter 7: Logical Reasoning — Structure & Parallelism

7.1 Main Conclusion & Role of Statement Questions 7.2 Method of Reasoning Questions 7.3 Parallel Reasoning & Parallel Flaw Questions

8 Chapter 8: Reading Comprehension — Passage Architecture & Active Mapping

8.1 RC Passage Types & Content Areas 8.2 Active Reading & Structural Mapping 8.3 Comparative (Paired) Passages Strategy

9 Chapter 9: Reading Comprehension — Question Types & Passage Mastery

9.1 Global Questions: Main Idea & Primary Purpose 9.2 Detail & Specific Reference Questions 9.3 Inference, Tone & Application Questions

10 Chapter 10: Argumentative Writing & Test Day Execution

10.1 Argumentative Writing Prompt Architecture 10.2 Drafting a High-Scoring Essay 10.3 Test Day Preparation & Mindset

2.3 Quantifiers & Formal Logic Sets

Key Takeaways Explain This Topic AI

LSAT quantifiers occupy precise quantitative ranges: 'All' = 100%, 'Most' = 51% to 100%, 'Some' = 1% to 100% (at least one), and 'None' = 0%.

'Some' and 'None' statements are logically symmetric (reversible), whereas 'All' and 'Most' statements are asymmetric.

Valid quantifier inferences include combining a 'Most' statement with a universal 'All' statement pointing away, and applying the Double-Most Overlap Rule to infer 'Some' from shared left-hand bases.

You cannot combine two 'Some' statements or a 'Some' with a 'Most' statement without a universal conditional bridge.

Last updated: July 2026

2.3 Quantifiers & Formal Logic Sets

While strict conditional logic deals in absolute binaries (Yes/No, 100%/0%), real-world arguments frequently involve degrees of scope. The LSAT tests these degrees using quantifiers : words like all, most, many, some, few, several , and none . Interpreting quantifier ranges precisely and knowing which quantifier statements can be combined is essential for mastering formal logic questions.

Understanding Quantifiers in LSAT Formal Logic

On the LSAT, quantifiers have strict, standardized definitions that often differ from everyday conversational English.

  • The Quantifier Spectrum 0% 1% 51% 100%
  • ├───────────────────┼────────────────────────────────┼──────────────────────┤
  • │ NONE (0%) │ SOME (1% - 100%) │ MOST (51% - 100%) │
  • │ │ (At least one / Possibility) │ (Majority / >50%) │
  • └───────────────────┴────────────────────────────────┴──────────────────────┘
  • │ ALL (100%) │
  • └──────────────────────┘

Quantifier LSAT Formal Definition Quantitative Range Notation Reversible / Symmetric?

ALL Every single member without exception. 100% A ⟶ B A \longrightarrow B A ⟶ B NO (Asymmetric)

MOST A strict majority; more than half. 51% to 100% A → most B A \xrightarrow{\text{most}} B A most ​ B NO (Asymmetric)

SOME At least one; possibly all. 1% to 100% A ↔ some B A \xleftrightarrow{\text{some}} B A some ​ B YES (Symmetric)

  • NONE Zero members; mutually exclusive. 0% A ⟶ ¬ B A \longrightarrow \neg B A ⟶ ¬ B YES (Symmetric)
  • Critical Quantifier Definitions

SOME means "At least one" : In everyday speech, if someone says "Some of my friends are lawyers," they usually imply "not all." On the LSAT, SOME includes the possibility of ALL . "Some A are B" simply guarantees that the intersection of Set A and Set B contains at least one item.

MOST means "More than half" : MOST ranges from 51% to 100%. It does not mean "almost all" or "the vast majority." 50.1% satisfies MOST .

MANY / SEVERAL / FEW :

Many and Several are categorized as SOME (at least one, range unknown).

  • Few means "Some are, but Most are not."
  • The Properties & Symmetry of Quantifiers

Understanding symmetry allows you to instantly manipulate statements during analysis.

Symmetric (Reversible) Quantifiers

SOME : If "Some archaeologists ( A A A ) are scuba divers ( S S S )", it is 100% logically equivalent to say "Some scuba divers ( S S S ) are archaeologists ( A A A )". A ↔ some S ⟺ S ↔ some A A \xleftrightarrow{\text{some}} S \quad \iff \quad S \xleftrightarrow{\text{some}} A A some ​ S ⟺ S some ​ A

NONE : If "No reptiles ( R R R ) have feathers ( F F F )", it is logically equivalent to say "No feathered creatures ( F F F ) are reptiles ( R R R )". R ⟶ ¬ F ⟺ F ⟶ ¬ R R \longrightarrow \neg F \quad \iff \quad F \longrightarrow \neg R R ⟶ ¬ F ⟺ F ⟶ ¬ R

Asymmetric (Non-Reversible) Quantifiers

ALL : Knowing "All golden retrievers ( G G G ) are dogs ( D D D )" does NOT allow you to infer "All dogs are golden retrievers." (That would be a Mistaken Reversal).

MOST : Knowing "Most billionaires ( B B B ) are over 40 years old ( O O O )" does NOT allow you to infer "Most people over 40 years old are billionaires."

Formal Logic Inference Rules & Invalidation Controls

When multiple quantifier statements are combined in a stimulus, specific mathematical rules dictate whether a valid inference can be drawn.

Rule 1: The Left-Hand "ALL" Bridge (Universal Combination)

You can combine a quantifier statement with a universal conditional statement ONLY IF the universal statement points away from the common term or serves as the left-hand base. Premise 1: A → most B \text{Premise 1: } A \xrightarrow{\text{most}} B Premise 1: A most ​ B Premise 2: B ⟶ C \text{Premise 2: } B \longrightarrow C Premise 2: B ⟶ C Valid Inference: A → most C \text{Valid Inference: } A \xrightarrow{\text{most}} C Valid Inference: A most ​ C

Logic : If most A's fall into bucket B, and every single item in bucket B automatically moves to bucket C, then most A's must end up in bucket C.

Rule 2: The Double-Most Overlap Principle

If two MOST statements originate from the SAME left-hand base, their majorities must overlap, yielding a valid SOME inference. Premise 1: A → most B ( > 50 % of A ) \text{Premise 1: } A \xrightarrow{\text{most}} B \quad ( >50\% \text{ of } A) Premise 1: A most ​ B ( > 50% of A ) Premise 2: A → most C ( > 50 % of A ) \text{Premise 2: } A \xrightarrow{\text{most}} C \quad ( >50\% \text{ of } A) Premise 2: A most ​ C ( > 50% of A ) Valid Inference: B ↔ some C \text{Valid Inference: } B \xleftrightarrow{\text{some}} C Valid Inference: B some ​ C

Mathematical Proof : Imagine Set A has 100 members. Most A are B means at least 51 are B. Most A are C means at least 51 are C. Even if you separate B and C as much as possible ( 51 + 51 = 102 51 + 51 = 102 51 + 51 = 102 ), at least 2 members must belong to both B and C. Thus, at least one B must be a C.

Invalid Quantifier Combinations (NO INFERENCE ALLOWED)

Attempted Combination Why No Inference Is Possible Common Trap

SOME + SOME ; ( A ↔ some B A \xleftrightarrow{\text{some}} B A some ​ B and B ↔ some C B \xleftrightarrow{\text{some}} C B some ​ C ) The some-members of B that are A might be completely distinct from the some-members of B that are C. Assuming A ↔ some C A \xleftrightarrow{\text{some}} C A some ​ C .

SOME + MOST ; ( A ↔ some B A \xleftrightarrow{\text{some}} B A some ​ B and B → most C B \xrightarrow{\text{most}} C B most ​ C ) The single A that is a B could be in the <50% minority of B that is NOT C. Assuming A ↔ some C A \xleftrightarrow{\text{some}} C A some ​ C .

MOST + MOST (Different Bases) ; ( A → most B A \xrightarrow{\text{most}} B A most ​ B and B → most C B \xrightarrow{\text{most}} C B most ​ C ) The majority of B that are C might not include any of the B's that came from A. Transitive chain fallacy.

Overlap Logic, Set Theory & Venn Diagrams on the LSAT

When LSAT problems involve numerical overlaps or set intersections, visualizing the relationships via overlapping set tables or Venn diagrams prevents errors. +-----------------------------------------------------------------------+

  • | SET OVERLAP MATRIX |
  • | |
  • | Total Group A Population = 100 |
  • | ├── Members in Set B (Most) = 60 |
  • | └── Members in Set C (Most) = 70 |
  • | |
  • | Minimum Overlap (B ∩ C) = (60 + 70) - 100 = 30 |
  • | Maximum Overlap (B ∩ C) = min(60, 70) = 60 |
  • | |
  • | Conclusion: At least 30 members (SOME) belong to both B and C. |
  • +-----------------------------------------------------------------------+
  • Concrete LSAT Worked Examples & Deep Strategic Analysis
  • Worked Example 1: Multi-Quantifier Inference Chain

Passage : All senior partners at Law Firm X are equity shareholders. Most senior partners at Law Firm X specialize in corporate litigation. No attorney who specializes in corporate litigation works on pro bono publico cases.

Step 1: Formalize each statement :

Senior Partner ( S P SP SP ) ⟶ \longrightarrow ⟶ Equity Shareholder ( E S ES ES ).

Senior Partner ( S P SP SP ) → most \xrightarrow{\text{most}} most ​ Corporate Litigator ( C L CL C L ).

Corporate Litigator ( C L CL C L ) ⟶ ¬ \longrightarrow \neg ⟶ ¬ Pro Bono ( P B PB PB ).

Step 2: Derive Valid Inferences :

Inference A (Combining 2 & 3): Since S P → most C L SP \xrightarrow{\text{most}} CL SP most ​ C L and C L → ¬ P B CL \rightarrow \neg PB C L → ¬ PB , we get: S P → most ¬ P B SP \xrightarrow{\text{most}} \neg PB SP most ​ ¬ PB ("Most senior partners do not work on pro bono cases").

Inference B (Double Base on S P SP SP ): S P → E S SP \rightarrow ES SP → ES means All S P SP SP are E S ES ES . Combined with S P → most C L SP \xrightarrow{\text{most}} CL SP most ​ C L , we get: E S ↔ some C L ES \xleftrightarrow{\text{some}} CL ES some ​ C L ("Some equity shareholders specialize in corporate litigation").

Inference C (From 1 & Inference A): Since All S P SP SP are E S ES ES , and Most S P SP SP are ¬ P B \neg PB ¬ PB , we get: E S ↔ some ¬ P B ES \xleftrightarrow{\text{some}} \neg PB ES some ​ ¬ PB ("Some equity shareholders do not work on pro bono cases").

Loading diagram... Quantifier Inference Rules & Overlap Map