Apps
Explore
Aspect DirectoryKnowledge GraphAnalysis Lenses
Learn
Get StartedWhy TellDearGuideArticlesEssentialsGlossaryFAQDocumentationProviders
DE — DeutschLogin

🧪 This platform is in early beta. Features may change and you might encounter bugs. We appreciate your patience!

Quantifier Shift Fallacy

Also Known As: Quantifier Scope Fallacy Scope Ambiguity
Formal Fallacy ID: quantifier_shift

Definition

The quantifier shift fallacy occurs when the order of quantifiers is illegitimately switched, changing the meaning of a statement. 'For every X there exists a Y' is very different from 'there exists a Y for every X.' The first says each X has its own Y (possibly different), while the second says one single Y serves all X. This subtle reordering can completely change a true statement into a false one.

Examples

"Every person has a number that, when added, makes them happy." becomes "There is a number that makes every person happy when added." (The first says everyone has their own happiness number; the second claims one number works for everyone.)

'Every employee has a manager they report to' is incorrectly restated as 'There is one manager that every employee reports to.' The first allows each employee to have a different manager; the second implies a single universal manager for all.

'Every student has a topic they find interesting' gets shifted to 'There is a topic that every student finds interesting.' The original respects individual differences in curiosity; the shifted version wrongly assumes one universally appealing topic exists.

Formal Logic Pattern
FOL Pattern
The First-Order Logic formula representing this reasoning pattern's logical structure.
FOL (First-Order Logic) uses quantifiers (∀ = for all, ∃ = there exists), connectives (∧ = and, ∨ = or, ⇒ = implies, ¬ = not), and predicates to capture the essential form of a reasoning pattern. For example, the Ad Hominem fallacy: Person(x) ∧ HasFlaw(x) ⇒ Invalid(Claim(x)). These patterns allow automated verification of logical validity.
View in glossary →

FORALL x EXISTS y: R(x,y) -> EXISTS y FORALL x: R(x,y) [invalid]
Formal Verification:
Formal Verification
Checks whether a reasoning pattern is logically valid or invalid using an automated theorem prover.
Formal verification uses an SMT (Satisfiability Modulo Theories) solver — specifically Z3 — to mathematically check whether an argument's logical structure is valid. Each reasoning pattern is translated into First-Order Logic and tested: Can the premises be true while the conclusion is false? If yes, it's formally invalid. If no, it's formally valid. Many real-world patterns (analogies, heuristics) cannot be fully captured in formal logic — these are marked as not formally decidable, which doesn't mean they're wrong.
View in glossary →
Not formally decidable

Verification Steps
Verification Steps
Binary yes/no questions that an AI must answer to detect a reasoning pattern in a text.
Each of the 452 aspects has verification steps — simple yes/no questions designed to systematically detect whether a pattern appears in a text. For ad hominem: "Does the argument attack a person rather than their claim?" For false dichotomy: "Are only two options presented when more exist?" This ensures consistent, reproducible analysis.
View in glossary →

Binary (yes/no) questions an LLM must answer to identify this aspect:

  1. 1

    Does the argument involve quantifiers (all, some, every, there exists)?

    Type: binary
  2. 2

    Has the order of quantifiers been switched between premises and conclusion?

    Type: binary
  3. 3

    Does the reordering of quantifiers change the meaning of the statement?

    Type: binary
Deep Dive
The expandable detail section on each aspect page with examples, psychology, and counter-strategies.
The Deep Dive section provides in-depth information about each aspect: a real-world example showing the pattern in action, an explanation of why it works psychologically, practical advice on how to counter it, alternative names, and links to related aspects.
View in glossary →

Hierarchical Context

→ is a Formal Fallacies

Try it in action

Use these tools to detect, analyze, or train this aspect.

🎓 Fallacy Trainer

Quiz yourself on this aspect

Next →
🔍 Text Analyzer

Scan a text for this pattern

Next →
⚗️ Argument Lab

Analyze an argument step by step

Next →