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

The Covering Law Model

Graduate Depth 88 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
451prerequisites beneath it
See this on the map →
The Deductive-Nomological Model of ExplanationFirst-Order Logic Syntax+1 more→→Causal ExplanationThe Unificationist Model of Explanation
covering-law inductive-statistical explanation laws

Core Idea

The covering law model extends the D-N model to include inductive-statistical explanations where the explanans makes the explanandum probable by subsuming it under statistical laws. This captures explanations in quantum mechanics, genetics, and social science using probabilistic laws rather than strict universals. However, high statistical correlation provides a covering law but intuitively fails to explain: a barometer's rise doesn't explain incoming storms even though both are covered by meteorological laws.

Explainer

You already understand the deductive-nomological (D-N) model: an explanation is a valid deductive argument whose premises include at least one natural law, and whose conclusion is the phenomenon to be explained. The covering law model is the generalization of that framework. It says that all scientific explanation has a common logical structure: the phenomenon is *covered* — subsumed — by one or more laws, and citing those laws is what makes something an explanation rather than a mere description. The D-N model is the deductive special case; the covering law model also includes the inductive-statistical (I-S) model, which handles probabilistic laws.

The I-S extension matters because much real science is irreducibly statistical. In quantum mechanics, a law might say that a radioactive atom has a 50% chance of decaying in a given interval — not that it *will* decay. In epidemiology, smoking raises the probability of lung cancer without guaranteeing it. In Mendelian genetics, a heterozygous parent passes a dominant allele to each offspring with probability 1/2. The I-S model says these probabilistic laws still explain outcomes by raising their probability. The key requirement is high probability: the law-plus-conditions must make the event very likely. An explanation of why this patient recovered from strep throat by citing that penicillin cures strep infections in 90% of cases is a genuine explanation precisely because the probability is high — you've been covered by a strong statistical law.

This generates an immediate problem: the reference class problem. Whether an event has high probability depends entirely on how you describe it. The same patient might also belong to a subclass — say, patients with a particular allergy — where the recovery rate is much lower. There is no principled way to choose the "right" reference class without already knowing what the explanation should look like. This threatened to make I-S explanations circular or indeterminate, and prompted Hempel to introduce the requirement of maximal specificity: use the most specific reference class for which you have relevant information.

The deeper challenge is the asymmetry and irrelevance problems. Suppose a law says that the height of a flagpole's shadow correlates perfectly with the pole's height plus the sun's angle. You can deduce the pole's height from the shadow length and the angle — but that doesn't *explain* the pole's height; it's the other way around. The covering law model permits explanations to run in logically valid but causally backward directions. Similarly, the barometer case: rising barometric pressure and approaching storms are both covered by the same meteorological laws, but the barometer's reading does not explain the storm. These cases suggest that explanation requires something the covering law model omits: asymmetric causal structure. This failure motivates rival accounts — causal-mechanical explanation and unificationist explanation — which build causation or explanatory power directly into the analysis.

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 → The Covering Law Model

Longest path: 89 steps · 451 total prerequisite topics

Prerequisites (3)

Leads To (2)