Apps

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

Affirming the Consequent

Also Known As: Converse Error Fallacy of the Converse
Formal Fallacy ID: affirming_consequent

Definition

Affirming the consequent is a formal logical error where one assumes that because a conditional statement is true and the consequent (the 'then' part) is true, the antecedent (the 'if' part) must also be true. This ignores the possibility that multiple antecedents could produce the same consequent. For instance, 'if it rains, the ground is wet' does not mean wet ground proves it rained -- a sprinkler could be the cause.

Examples

"If someone is a doctor, they went to university. Sarah went to university. Therefore, Sarah must be a doctor."

If it's raining, the streets will be wet. The streets are wet. Therefore, it must be raining.

Our marketing team said that if we launch a viral campaign, sales will spike this quarter. Sales spiked this quarter. So our campaign must have gone viral.

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.

(A ⇒ B) ∧ B ⇒ 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.
Formally invalid

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

    Does the argument have an 'If A then B' conditional structure?

    Type: binary
  2. 2

    Does the argument assert the consequent (B) is true?

    Type: binary
  3. 3

    Does it conclude the antecedent (A) must therefore be true?

    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