Apps

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

Argument from Analogy

Also Known As: Analogical Argument Case-Based Reasoning
Discourse Mechanics ID: argument_from_analogy

Definition

A fundamental argumentation scheme that transfers a conclusion from a known case to an unknown case based on relevant similarities between the two. The scheme is defeasible: it can be challenged by identifying relevant differences (disanalogies) between the cases.

Examples

Banning DDT was effective in protecting bird populations (known case). Therefore, banning this similar pesticide should also protect bird populations (transferred conclusion).

Raising the minimum wage in Seattle did not significantly increase unemployment (known case). Therefore, raising the minimum wage in a similarly sized city with a comparable economy should also not significantly increase unemployment (transferred conclusion).

Helmet laws for motorcyclists reduced head injury deaths substantially (known case). Therefore, mandatory helmet laws for cyclists should similarly reduce cycling-related head injury deaths (transferred conclusion), given the analogous mechanism of protecting the skull during a crash.

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,R) ∧ P(A) ⇒ P(B)
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 comparison drawn between two cases?

    Type: binary
  2. 2

    Are the two cases similar in relevant respects?

    Type: binary
  3. 3

    Is a property or conclusion transferred from the known case to the unknown case based on the similarity?

    Type: binary
  4. 4

    Are the critical questions about disanalogies addressed?

    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.