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

The Problem of Induction

Graduate Depth 99 in the knowledge graph ☐ I know this ☆ Set as goal
75topics build on this
537prerequisites beneath it
See this on the map →
Inductive ReasoningEmpiricism in Scientific Inquiry+3 more→→Confirmation and EvidenceInductive Justification and Generalization+3 more
induction justification logic

Core Idea

Hume showed that inductive inference—concluding universal laws from repeated observations—cannot be logically justified. The fact that the sun has risen every day in the past does not logically guarantee it will tomorrow. This challenge remains central to philosophy of science because all empirical science relies on generalizing from observed instances to universal claims.

How It's Best Learned

Start with Hume's original problem formulation. Then study Popper's falsificationist response and modern Bayesian approaches to see the landscape of proposed solutions.

Common Misconceptions

Thinking induction is illogical (Hume allows practical induction, just denies its theoretical justification). Confusing induction with deduction. Assuming the problem is purely logical rather than epistemological.

Explainer

You already understand inductive reasoning: it is the move from particular observations to general conclusions. The sun has risen every day in recorded history, so we conclude it will rise tomorrow. Every copper sample we have tested conducts electricity, so we generalize that copper is electrically conductive. Science depends on this pattern constantly. Hume's devastating observation was simple: this inference is never deductively valid. The premises — all the past sunrises — do not *guarantee* the conclusion. The future could, as far as logic is concerned, deviate from the past in any way whatsoever. No number of observed instances logically compels the universal conclusion.

The deeper problem is that attempts to justify induction seem to require using induction itself. Why do we trust that the future will resemble the past? The most natural answer is: "Because in the past, the future has always resembled the past." But this is precisely the kind of inductive argument whose validity is in question. Any defense of induction that appeals to past success of induction is viciously circular. Hume concluded that our habit of inductive inference is psychologically irresistible — custom and habit, not rational justification — and that we cannot provide a non-circular philosophical foundation for it.

This cuts to the heart of science. From empiricism you know that scientific knowledge is grounded in observation and experiment. But observations give us particular facts; scientific laws are universal claims. Every generalization in science — Newton's laws, the laws of thermodynamics, evolutionary theory — makes a claim that goes beyond the finite observations supporting it. If induction cannot be rationally justified, how can science claim to produce genuine knowledge rather than merely well-confirmed belief? Hume's problem is not a logical puzzle to be solved and set aside; it is an open wound in the foundations of empirical knowledge.

Karl Popper's response — which you will study in falsificationism — was to abandon justification entirely. We cannot verify universal laws, but we can falsify them: a single contrary observation logically refutes the universal claim. Science proceeds not by accumulating confirming instances but by making bold conjectures and subjecting them to rigorous attempts at refutation. The Bayesian response takes a different route: rather than demanding logical certainty, it replaces the demand for justification with a probabilistic framework. Prior credences are updated by evidence using Bayes' theorem, and "justified" comes to mean having high posterior probability given the evidence. Neither solution fully dissolves Hume's challenge — Popper does not explain why we should act on unfalsified theories, and Bayesianism must still assume that past evidence is relevant to future credences — but they represent the two most influential frameworks for living with the problem rather than solving it.

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

Longest path: 100 steps · 537 total prerequisite topics

Prerequisites (5)

Leads To (5)