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

Confirmation and Evidence

Research Depth 100 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
538prerequisites beneath it
See this on the map →
Inductive ReasoningThe Problem of Induction+1 more→→Bayesian Approaches to ConfirmationExplanatory Power and Unification
confirmation evidence support hypothesis

Core Idea

Confirmation theory asks: When does evidence support or confirm a hypothesis? What makes one piece of evidence more confirmatory than another? Scientists intuitively assess evidence quality, but formalizing these judgments is philosophically challenging. Logical positivists sought deductive models, while modern approaches use probability theory and Bayesian inference to quantify how observation updates belief in hypotheses.

Explainer

From your study of Hume's problem of induction, you know that no finite set of observations logically entails a universal generalization. No number of observed black ravens proves "all ravens are black." But science clearly works by gathering evidence, and some evidence genuinely supports hypotheses more than others. Confirmation theory is the attempt to make this intuition precise: to give a formal account of when and how much an observation supports a hypothesis. The difficulty is that our intuitions about evidential support, when pressed, generate genuine paradoxes.

The most famous is Carl Hempel's ravens paradox. Consider the hypothesis H: "All ravens are black." Observing a black raven seems to confirm it. Now consider the logically equivalent statement H': "All non-black things are non-ravens." A green apple is a non-black non-raven — it satisfies H'. Since H and H' say exactly the same thing (they are logically equivalent), and the green apple confirms H', it must also confirm H. But this seems absurd: you can sit in your living room collecting green apples and thereby (trivially) confirm the hypothesis about ravens. Hempel's response was to bite the bullet and accept that the apple does weakly confirm H — the counterintuitiveness reflects a pragmatic point about where we expect evidence to come from, not a logical error. But this answer is unsatisfying.

The Bayesian approach offers a cleaner resolution. Bayesian confirmation defines "E confirms H" as: the probability of H given E is higher than the prior probability of H. Formally, E confirms H if P(H|E) > P(H), which is equivalent to saying that E is more probable given H than given ¬H: P(E|H) > P(E|¬H). On this account, the green apple does confirm "all ravens are black" — but only infinitesimally. Before seeing the apple, almost all physical objects were non-black non-ravens; seeing one more doesn't update H much at all. Observing a black raven, by contrast, provides significantly more confirmation because ravens are much rarer than non-black things, making the raven observation more informative. The Bayesian framework explains why the apple confirmation feels trivial without denying it.

What the Bayesian approach reveals is that confirmation is gradational and context-sensitive — it is not a binary on/off relation but a matter of degree, governed by prior probabilities and the likelihood ratio P(E|H)/P(E|¬H). Evidence is more confirmatory when it was more likely to occur if the hypothesis is true and less likely if the hypothesis is false. This connects directly to your understanding of inductive reasoning: induction is not a single monolithic rule but a probabilistic updating process, and its strength depends on the specific evidential situation. The apparent paradoxes of confirmation largely dissolve once we shift from seeking a simple logical relation between statement and evidence to thinking in terms of probability updating — which is why Bayesian confirmation theory is the foundation of the more advanced framework you'll study next.

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 → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Introduction to Intuitionistic Logic → Introduction to Modal Logic → A Priori and A Posteriori Knowledge → Rationalism vs. Empiricism → The Problem of Induction → Confirmation and Evidence

Longest path: 101 steps · 538 total prerequisite topics

Prerequisites (3)

Leads To (2)