All, Some, Most, and No on the LSAT: How Quantifiers Work in Logical Reasoning

The words 'all,' 'some,' 'most,' 'no,' and 'none' appear constantly in LSAT Logical Reasoning. In everyday speech, these words are often used loosely — 'some' usually implies 'not many,' 'most' usually implies 'a large majority,' and 'all' is often used for emphasis even when exceptions exist.

On the LSAT, these words have precise logical meanings, and those meanings are not what most students assume. A single misread quantifier can invalidate an entire chain of reasoning — leading you to accept invalid inferences or reject valid ones.

Understanding exactly what each quantifier means and what inferences it licenses is one of the foundational skills for LSAT Logical Reasoning.

'All X are Y' means: without exception, every member of group X is also a member of group Y. There is no X that is not also Y.

Diagram: X → Y

Valid inferences from 'All X are Y': If something is X, it is Y. If something is not Y, it is not X (contrapositive). That is all. You cannot conclude that all Y are X (that would be the invalid reversal). You cannot conclude that non-X things are non-Y (that would be the invalid inverse).

Example: 'All registered lawyers in the state are licensed.' From this you can infer: if she is a registered lawyer in the state, she is licensed. And: if she is not licensed, she is not a registered lawyer in the state. You cannot infer that everyone who is licensed is a registered lawyer — there could be other licensed professionals.

Everyday trap: students read 'all lawyers are licensed' and think 'so licensed people must be lawyers.' That is the reversal fallacy. The LSAT builds flaw questions around exactly this error.

'Some X are Y' means: at least one X is also Y. It does not mean 'a few' or 'not many' or 'a minority.' It means at least one — and it is equally true whether ten percent, fifty percent, or ninety-nine percent of X are Y.

This is the biggest quantifier trap on the LSAT. Students read 'some' as implying a small portion, which leads to mistaken inferences when 'some' actually covers the entire group.

'Some X are Y' is equivalent to 'some Y are X.' The relationship is symmetric — this is one of the few valid reversals in LSAT logic, and it only applies to 'some' statements.

Example: 'Some of the applicants were rejected.' This is true whether one applicant was rejected or all but one were rejected. You cannot infer how many were rejected. You can infer that 'some rejected individuals were applicants.'

What you cannot infer from 'Some X are Y': All X are Y. All Y are X. Most X are Y. No X is not-Y. 'Some' is a very weak statement — it only guarantees the existence of at least one.

'Most X are Y' means: more than half of X are Y. 'Most' implies a majority — more than 50% — but it does not imply a large majority. 51% qualifies as 'most.'

'Most' is stronger than 'some' but weaker than 'all.' From 'most X are Y' you can infer that 'some X are Y,' because if the majority are Y, then at least one is.

A key LSAT inference: if 'Most X are Y' and 'Most X are Z,' it does not necessarily follow that 'Most Y are Z.' These two 'most' statements can coexist without overlap between Y and Z being guaranteed — though some overlap is guaranteed. Specifically, you can conclude that 'Some Y are Z' (and 'Some Z are Y') when both most-X-are-Y and most-X-are-Z hold.

What you cannot infer from 'Most X are Y': All X are Y. Most Y are X (this does not follow). No X is not-Y.

'No X are Y' means: without exception, there is no member of X that is also a member of Y. X and Y have zero overlap.

This statement is symmetric: 'No X are Y' is logically equivalent to 'No Y are X.' If no doctors are lawyers, then no lawyers are doctors.

Contrapositive: 'No X are Y' can be rewritten as 'All X are non-Y' (every X is outside of Y). The contrapositive is 'All Y are non-X.'

Example: 'No board members voted for the proposal.' This means every board member is someone who did not vote for it. Contrapositive: everyone who voted for it is not a board member.

What you cannot infer from 'No X are Y': Some X are not Y — well, actually this does follow (if no X are Y, then certainly some X are not Y, since all X are not Y). What you cannot infer is any affirmative connection between X and any third group.

Most LSAT questions involving quantifiers require you to combine two or more quantified statements and determine what follows.

All A are B + All B are C → All A are C. (Valid chain.)

All A are B + Some B are C → Some A are C? No — this does not follow. Some of the B that are C might not be A. 'All A are B' does not guarantee that A and the C-subset of B overlap.

All A are B + No B are C → No A are C. (Valid. Since all A are B, and no B are C, no A can be C.)

Some A are B + All B are C → Some A are C. (Valid. The A-members that are B are also C, so some A are C.)

Some A are B + Some B are C → Some A are C? No — this does not follow. The A-members of B and the C-members of B might be entirely different individuals.

These chain patterns appear in LSAT inference questions, assumption questions, and flaw questions. Memorizing which combinations yield valid conclusions saves significant time.

The most common errors: treating 'some' as implying a small minority, treating the reversal of 'all' as valid, treating two 'some' statements as implying overlap, and treating 'most' as equivalent to 'all.'

Flaw questions that test quantifiers: 'The argument's error consists of concluding that because all members of group X are members of group Y, all members of group Y must be members of group X.' That is the reversal fallacy applied to 'all' statements. Recognizing this pattern in a flaw question requires knowing that the reversal of an 'all' statement is invalid.

Assumption questions: if the conclusion introduces 'all' but the premises only establish 'most,' the argument has assumed that 'most' means 'all.' That gap is the necessary assumption — and it can be verified with the negation test.

Must be true questions: if the stimulus contains 'some A are B' and 'all B are C,' a must-be-true question might offer 'Some A are C' as the correct inference. Recognizing this valid chain is the skill being tested.

Q: Does 'some' on the LSAT mean 'a few'? No. 'Some' means at least one. If 99% of students passed, it is still true that 'some students passed.' The LSAT uses 'some' in its precise logical sense, not the colloquial sense of 'a small number.'

Q: Can I reverse a 'some' statement? Yes. 'Some X are Y' is equivalent to 'Some Y are X.' This is one of the only valid reversals in LSAT logic. It does not apply to 'all' or 'most.'

Q: Is 'most' stronger than 'some' on the LSAT? Yes. 'Most X are Y' entails 'Some X are Y' — if most are, then certainly at least one is. But 'some X are Y' does not entail 'Most X are Y.'

Q: What does 'not all X are Y' mean? It means 'At least one X is not Y.' It is the negation of 'All X are Y.' It does not mean 'Most X are not Y' or 'No X are Y.'

Quantifier logic underlies inference questions, assumption questions, and flaw questions throughout LSAT Logical Reasoning. Getting the meaning of 'all,' 'some,' 'most,' and 'no' exactly right is a small investment with a large payoff across many question types.

Verbloom's Logical Reasoning practice includes questions that specifically test quantifier inferences, with explanations that show exactly why each inference is valid or invalid.

Start practicing at verbloom.dev.