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

Bayesian Confirmation Theory

Research Depth 103 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
708prerequisites beneath it
See this on the map →
Bayesian EpistemologyProbabilistic Reasoning→→Bayesian Approaches to ConfirmationTheoretical Virtues in Theory Choice
confirmation bayesian evidence

Core Idea

Bayesian confirmation theory treats evidential support probabilistically: evidence confirms a hypothesis when observing it raises the hypothesis's probability. This formalizes the intuitive idea that evidence must be more likely given the theory than it would be otherwise, providing a quantitative measure of confirmation.

How It's Best Learned

Learn Bayes' theorem and apply it to simple scientific examples. Study how it handles problems like old evidence and the ravens paradox that troubled earlier confirmation theories.

Explainer

You already know Bayes' theorem from your study of Bayesian epistemology: P(H|E) = P(E|H) × P(H) / P(E). Bayesian confirmation theory applies this machinery to the philosophy of science. The central claim is simple: evidence E confirms hypothesis H if observing E raises the probability of H — formally, if P(H|E) > P(H). Evidence that leaves H's probability unchanged is irrelevant, and evidence that lowers H's probability disconfirms it. This gives us a quantitative framework for the qualitative intuition that data should update our confidence in theories.

The key ratio that drives confirmation is P(E|H) / P(E|¬H) — the likelihood ratio. Evidence confirms H strongly when it is much more likely if H is true than if H is false. If you observe a raven and it is black, this confirms the hypothesis "all ravens are black" — but only weakly, because black ravens are common anyway. If you observe a raven and it is *white*, this strongly disconfirms the hypothesis, because the hypothesis makes white ravens strictly impossible while the alternative does not. The asymmetry between confirmation and disconfirmation here reflects a real structural feature: a single counterexample defeats a universal claim decisively, while confirming instances raise the probability by only a small amount.

Bayesian confirmation handles several puzzles that troubled earlier theories. The ravens paradox (Hempel's paradox): "All ravens are black" is logically equivalent to "All non-black things are non-ravens," which seems to be confirmed by observing a green apple. Bayesian analysis shows this is technically correct — a green apple does raise the probability of "all ravens are black" — but only infinitesimally, because the sample space of non-black things is enormous. The Bayesian framework dissolves the paradox by showing the confirmation is real but negligible. The problem of old evidence is harder: if you already know E with certainty (P(E) = 1), then E cannot raise the probability of H because the math yields P(H|E) = P(H). Bayesians address this by imagining a counterfactual prior probability before learning E, though this remains contested.

The philosophical significance of Bayesian confirmation is that it grounds scientific rationality in the mathematics of probability. Scientific reasoning is not a mysterious faculty — it is Bayes' theorem applied to theories and evidence. Each observation updates your credences by a definite amount. Theories with high prior probability (from simplicity, coherence with known science, etc.) require less confirming evidence; theories that make bold predictions require that those predictions come true to earn high probability. The framework also clarifies what it means to have evidence *for* a theory at all: evidence is only evidence relative to alternatives. Data that confirms one hypothesis always implicitly compares it to competing hypotheses through the denominator P(E).

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 → The Sensitivity Condition and Tracking Truth → Anti-Luck Conditions and Sensitivity → Epistemic Luck → Responses to the Gettier Problem → Process Reliabilism → Bayesian Epistemology → Bayesian Confirmation Theory

Longest path: 104 steps · 708 total prerequisite topics

Prerequisites (2)

Leads To (2)