Apps

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

Suppressed Quantifier

Also Known As: Hidden Quantifier Fallacy Quantifier Ambiguity
Formal Fallacy ID: suppressed_quantifier

Definition

A formal fallacy where the quantifier in a proposition is suppressed or left ambiguous, allowing the arguer to shift between 'some' and 'all' interpretations as convenient. This exploits the natural language tendency to omit quantifiers.

Examples

Scientists say this chemical is dangerous. (Which scientists? All of them? Some? A majority?)

A news headline reads 'Economists warn new trade policy will cause recession.' The article never specifies whether this represents a consensus, a majority view, a vocal minority, or just two economists quoted in a press release — allowing readers to assume universal expert agreement.

An advertisement claims 'Dentists recommend brushing twice daily with fluoride toothpaste.' No quantifier is provided: Is this all dentists? Most? A panel of six paid consultants? The suppressed quantifier allows the claim to imply universal professional endorsement without actually asserting it.

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.

∃x(P(x)) treated as ∀x(P(x))
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.
Formally invalid

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.

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

  1. 1

    Does the argument make a claim about a group or category?

    Type: binary
  2. 2

    Is the quantifier (all, some, most, none) left implicit or ambiguous?

    Type: binary
  3. 3

    Does the argument shift between universal and particular quantification without acknowledgment?

    Type: binary
  4. 4

    Would making the quantifier explicit reveal the argument as weaker or invalid?

    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.