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

The Epistemic Regress Argument

College Depth 100 in the knowledge graph ☐ I know this ☆ Set as goal
9topics build on this
537prerequisites beneath it
See this on the map →
The Epistemic Regress ProblemFoundationalism→→The Foundationalist Regress and Epistemic SupportThe Regress Problem: Formal Analysis
regress structure foundations justification-theory

Core Idea

The epistemic regress argument shows that any attempt to justify a belief by appeal to another belief faces a trilemma: justify that second belief (beginning an infinite regress), treat it as foundational (abandoning the demand for justification), or accept circular justification (begging the question). This argument provides the logical structure motivating foundationalism, coherentism, and infinitism as distinct systematic responses. Understanding regress structure is essential for evaluating all theories of justification.

How It's Best Learned

Formalize the trilemma: justifying belief B1 requires B2, justifying B2 requires B3, etc., leading to infinite regress (problematic), circular reasoning, or foundational beliefs. Map how each epistemological theory responds.

Common Misconceptions

Explainer

The regress problem you have already encountered identifies a pressing puzzle: if every justified belief requires justification from another belief, we face an infinite chain. The epistemic regress argument formalizes this puzzle into a trilemma that confronts anyone who holds that justification requires evidential support. Understanding the argument's structure — not just the problem it names — is the key to evaluating the competing theoretical responses that dominate epistemology.

Here is the argument laid out formally. Suppose you believe P, and someone asks you why. You offer justifying belief B1. They ask why you believe B1. You offer B2. And so on. This chain must end somewhere, and only three endings are available: (1) the chain is infinite, with each belief justified by another ad infinitum; (2) the chain is circular, eventually returning to a belief that was supposed to be justified; or (3) the chain terminates at some belief that is not itself justified by another belief — a foundational stopping point. These are the three horns of the trilemma, and each corresponds to a school of epistemology: infinitism (option 1), coherentism in its circular form (option 2), and foundationalism (option 3).

The argument is often misread as simply establishing that foundationalism is correct — as if the regress eliminates all other options. But understanding the structure reveals that each horn is a genuine, defensible position. Foundationalism (which you have studied) responds by positing basic beliefs — beliefs justified by non-doxastic sources like perception, memory, or rational intuition — that stop the regress at a terminus. Coherentism responds by rejecting the linear chain metaphor: justification is not a chain at all but a web, where each belief is supported by its coherence with the whole. Circularity is only a problem on the chain model; on the web model, beliefs support each other mutually without vicious circularity. Infinitism (associated with Peter Klein) argues that an infinite chain of reasons is not problematic as long as the reasons are available, even if not all consciously entertained simultaneously.

The practical upshot is that the regress argument is a diagnostic tool: it identifies exactly what any adequate theory of justification must explain. Every epistemological theory is, in part, a response to this trilemma — a choice about which horn to accept and a story about why that horn is not as bad as it initially seems. When you encounter a new theory of justification, the first question to ask is: how does it address the regress? Does it posit foundational beliefs? Holistic coherence? Infinitely available reasons? The regress argument maps the logical space of possible theories and makes it possible to evaluate them systematically.

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 → Foundationalism → The Epistemic Regress Argument

Longest path: 101 steps · 537 total prerequisite topics

Prerequisites (2)

Leads To (2)