Apps

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

Probabilistic Conjunction Error (Logical)

Also Known As: Linda Problem Conjunction Rule Violation
Formal Fallacy ID: conjunction_fallacy_logic

Definition

The logical form of the conjunction fallacy: concluding that a conjunction of events is more probable than one of its conjuncts alone. This violates a basic axiom of probability theory and formal logic concerning subset relationships.

Examples

Linda is more likely to be a bank teller AND a feminist activist than just a bank teller.

Mark is a retired army officer who frequently attends gun shows and has written letters to his local newspaper opposing federal regulations. People consistently rate it as more probable that Mark is a veteran AND a member of the NRA than that Mark is simply a veteran — despite the conjunction always being less probable than either component alone.

A weather app user is told there is a 70% chance of rain tomorrow. They reason that it is more likely to rain AND be cold than it is to simply rain, because rain and cold 'go together' — violating the basic probability rule that a conjunction cannot exceed the probability of its least likely conjunct.

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.

P(A ∧ B) ≤ P(A) violated
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 claim that a specific, detailed scenario is more likely than a more general one?

    Type: binary
  2. 2

    Is the specific scenario a subset of the general scenario (i.e., the specific scenario includes all conditions of the general one plus more)?

    Type: binary
  3. 3

    Does the reasoning violate the rule that P(A and B) cannot exceed P(A)?

    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.