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 ProblemFoundationalismThe 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSoundness Theorem and Validity of Proof SystemsDeductive Reasoning and Formal Proof SystemsFirst-Order ResolutionPropositional ResolutionSemantic Tableaux (Propositional)Semantic Tableaux (First-Order)Decidable Fragments of First-Order LogicGödel's Completeness Theorem for First-Order LogicGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicA Priori and A Posteriori KnowledgeRationalism vs. EmpiricismFoundationalismThe Epistemic Regress Argument

Longest path: 101 steps · 537 total prerequisite topics

Prerequisites (2)

Leads To (2)