Apps

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

Argument from Consequences (Scheme)

Also Known As: Pragmatic Argument Consequentialist Reasoning
Discourse Mechanics ID: argument_from_consequences

Definition

An argumentation scheme that evaluates a claim, policy, or action based on its consequences. In its legitimate form (pragmatic reasoning), it assesses whether the outcomes of adopting a position are desirable or undesirable. It becomes fallacious when used to argue that a factual claim is true or false based on whether its consequences are pleasant or unpleasant.

Examples

Legitimate: We should invest in renewable energy because the consequences include reduced pollution and energy independence. Fallacious: Climate change cannot be real because the consequences would be too terrible.

Legitimate: We should require calorie counts on restaurant menus because evidence shows it helps consumers make healthier choices and reduces obesity rates. Fallacious: The study showing that sugar causes addiction must be wrong, because if it were true, the entire beverage industry would need to be restructured.

Legitimate: We should implement two-factor authentication across all company accounts because the consequence of not doing so is significantly higher vulnerability to data breaches. Fallacious: We cannot accept that our product has a design flaw, because acknowledging it would expose the company to lawsuits.

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.

Action(A) ∧ Causes(A,C) ∧ Good(C) ⇒ ShouldDo(A)
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 policy, action, or belief being evaluated?

    Type: binary
  2. 2

    Is the evaluation based on the predicted consequences of accepting or rejecting it?

    Type: binary
  3. 3

    Are the predicted consequences empirically supported rather than merely asserted?

    Type: binary
  4. 4

    Is the argument about practical desirability rather than truth or falsity?

    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.