Apps

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

False Analogy (Weak Analogy)

Also Known As: Weak Analogy Faulty Analogy Questionable Analogy
Informal Fallacy ID: false_analogy

Definition

A false analogy draws a comparison between two things that share some superficial similarities but differ in ways that are critical to the argument being made. Analogies are powerful reasoning tools, but they become fallacious when the similarities are irrelevant to the conclusion or when key differences are ignored. The strength of an analogy depends on the relevance of the shared features.

Examples

"Running a country is just like running a business. A successful CEO would make a great president." (Countries have citizens with rights, not shareholders seeking profit; governments cannot fire citizens or go bankrupt in the same way businesses do.)

'The human brain is just like a computer — it stores memories like files and processes information like a CPU. So if your memory is bad, you just need to delete some old files to free up space.' Brains are not digital, memories are not discrete files, and neural storage works nothing like RAM or hard drives.

An anti-vaccine commentator argues: 'We don't let untested software updates install automatically on our computers, so why would we inject an untested substance into our bodies?' Software updates and vaccines differ fundamentally in how they are tested, how they interact with their systems, and what the risks of inaction are.

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.

Similar(A, B) in some respects; Property(A); therefore Property(B) [where similarity is insufficient]
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 an analogy or comparison being used to support the conclusion?

    Type: binary
  2. 2

    Are the two things being compared sufficiently similar in the relevant respects?

    Type: binary
  3. 3

    Do the differences between the compared things undermine the conclusion?

    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