Apps

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

Existential Fallacy

Also Known As: Existential Instantiation Error
Formal Fallacy ID: existential_fallacy

Definition

The existential fallacy occurs when a categorical syllogism draws a particular conclusion ('some X are Y') from two universal premises ('all X are Y') without establishing that the subject category actually has any members. Universal statements in modern logic do not imply existence -- 'all unicorns have horns' is vacuously true even if no unicorns exist. The fallacy assumes existence without establishing it.

Examples

"All perfect beings are all-knowing. All perfect beings are all-powerful. Therefore, some all-knowing beings are all-powerful." (This assumes that perfect beings actually exist; if they don't, the conclusion doesn't follow.)

'All unicorns have a single horn. All unicorns are magical creatures. Therefore, some magical creatures have a single horn.' (This assumes unicorns actually exist; if they don't, there are no magical creatures with horns to point to, making the particular conclusion unwarranted.)

'All perfectly just governments protect every citizen equally. All perfectly just governments eliminate corruption entirely. Therefore, some governments that eliminate corruption protect every citizen equally.' (The conclusion presupposes that perfectly just governments actually exist, which the universal premises alone do not establish.)

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.

ALL x: P(x) -> Q(x); therefore EXISTS x: P(x) AND Q(x) [without establishing EXISTS 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.
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.

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

  1. 1

    Are all premises universal statements?

    Type: binary
  2. 2

    Does the conclusion make a particular (existential) claim?

    Type: binary
  3. 3

    Has it been established that the category in question actually has members?

    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.

Hierarchical Context