A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Inductive-Statistical Explanation

Graduate Depth 88 in the knowledge graph ☐ I know this ☆ Set as goal
468prerequisites beneath it
See this on the map →
The Deductive-Nomological Model of ExplanationProbabilistic Reasoning→
explanation induction probability

Core Idea

Not all explanations are deductive; many cite probabilistic laws and statistical regularities. Hempel's inductive-statistical (IS) model allows that an event is explained when its occurrence is rendered highly probable by statistical laws and conditions. However, defining adequate probability thresholds and handling irrelevance pose persistent difficulties.

Explainer

You already understand the deductive-nomological (DN) model: a good scientific explanation is an argument in which the explanandum (what is to be explained) follows deductively from premises that include at least one general law. The DN model has intuitive appeal for deterministic science — if you know the laws and the initial conditions, the outcome follows necessarily. But much of science is irreducibly probabilistic. Quantum mechanics, genetics, epidemiology, and evolutionary biology all cite statistical laws. Does that mean they cannot explain? Hempel's inductive-statistical (IS) model extends the DN framework to cover these cases.

The structure of an IS explanation mirrors the DN structure, but with a crucial difference: instead of deductive entailment, the explanans (the explaining premises) *inductively support* the explanandum to a high degree of probability. Consider a simple case: Jones had streptococcal infection; penicillin is highly effective against streptococcal infection (a statistical law); therefore, Jones recovered. This is not deductively valid — Jones might have been one of the unlucky few for whom penicillin fails. But the premises make the recovery highly probable, and this high-probability inductive support is what constitutes the explanation. The argument form is: L (statistical law) + C (initial conditions) → [high probability] → E (event to be explained). The double line (⟹) signals that the inference is inductive, not deductive.

The requirement of high probability is where the model immediately runs into trouble. What counts as "high"? 0.9? 0.99? Hempel himself acknowledged that this threshold is vague. But a deeper problem emerges even if we accept some threshold: you can sometimes produce a high-probability argument that intuitively explains nothing. Suppose the statistical law is "people who take vitamin C very rarely get scurvy." If Jones takes vitamin C and does *not* get scurvy, the IS model says this is explained by the vitamin C, since scurvy had low probability given the dose. But surely vitamin C didn't explain the absence of scurvy — the explanation is adequate vitamin C from *any* dietary source, and the pill is irrelevant if diet was already sufficient. This is the irrelevance problem, which your probabilistic reasoning background will help you see clearly: high probability by itself does not guarantee that the cited factors are the *causally relevant* ones.

The most devastating challenge to the IS model is called the problem of ambiguity, introduced by Wesley Salmon. Statistical explanations are sensitive to the reference class under which you describe the event. Suppose John recovered from his infection. Under the reference class "patients who received penicillin," recovery has probability 0.9 — a good IS explanation. But under the reference class "patients who received penicillin *and* had a penicillin-resistant strain," recovery has probability 0.1 — no IS explanation, and in fact the event is surprising. The same event receives contradictory IS verdicts depending on which reference class we choose. Salmon's solution was to move away from the IS model entirely, toward causal-statistical explanation — the view that genuine explanation requires identifying the actual causal mechanisms responsible for the outcome, not merely high-probability statistical arguments. The IS model, for all its limitations, was historically essential in showing that explanation need not be deductive, clearing space for more sophisticated probabilistic and causal theories of explanation.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → 'Scientific Explanation: Core Problems' → The Deductive-Nomological Model of Explanation → Inductive-Statistical Explanation

Longest path: 89 steps · 468 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.