Apps

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

Argument from Sign

Also Known As: Abductive Reasoning from Signs Argument from Indication
Discourse Mechanics ID: argument_from_sign

Definition

An argumentation scheme that infers the existence of an unobservable condition from an observable sign that typically correlates with it. The strength of the argument depends on the reliability of the sign-condition correlation and the absence of alternative explanations for the sign.

Examples

The ground is wet (sign), so it must have rained (condition). Smoke is visible (sign), so there must be a fire (condition).

A doctor notices a patient has a high fever, swollen lymph nodes, and fatigue, and infers the patient likely has a bacterial or viral infection. Each symptom serves as a sign pointing toward an underlying condition that cannot be directly observed without further testing.

A financial analyst sees a sudden spike in insider stock purchases at a company and infers that executives likely have non-public knowledge of positive upcoming earnings. The trading pattern is a sign used to infer an unobservable internal condition.

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.

Sign(S) ∧ Generally(S → C) ⇒ C
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 observable indicator or sign being cited?

    Type: binary
  2. 2

    Is a conclusion about an unobserved state or condition drawn from this sign?

    Type: binary
  3. 3

    Is the connection between the sign and the conclusion based on a generally reliable correlation?

    Type: binary
  4. 4

    Are alternative explanations for the sign adequately considered?

    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.