Apps

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

Argument from Ignorance (Scheme)

Also Known As: Appeal to Ignorance (Scheme) Argumentum ad Ignorantiam
Discourse Mechanics ID: argument_from_ignorance_scheme

Definition

An argumentation scheme where the absence of evidence for a claim is treated as evidence against it (or the absence of counter-evidence is treated as support). This can be legitimate in closed-world contexts (if a thorough search found nothing, absence is informative) or fallacious in open-world contexts (where absence simply reflects incomplete knowledge).

Examples

Legitimate: After a thorough FBI investigation found no evidence of criminal activity, we can reasonably conclude there was no crime. Fallacious: No one has proven aliens don't exist, so they must exist.

Legitimate: Researchers conducted a large, well-designed double-blind trial and found no evidence that the supplement improves cognitive performance; we are therefore justified in concluding it is ineffective. Fallacious: No study has ever definitively proven that this herbal remedy does not cure cancer, so it must have some curative effect.

Legitimate: Geologists have extensively surveyed this region and found no evidence of fault lines, so it is reasonable to classify it as low seismic risk. Fallacious: Scientists have never proven that there is no Loch Ness Monster, so the creature probably 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.

¬Proven(P) ⇒ ¬P (or ¬Disproven(P) ⇒ P)
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

    Is a claim being made about something that has not been proven or disproven?

    Type: binary
  2. 2

    Is the lack of evidence treated as evidence for a position?

    Type: binary
  3. 3

    Has a thorough search for evidence been conducted?

    Type: binary
  4. 4

    Is the domain one where absence of evidence is meaningfully informative (closed-world assumption)?

    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.