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

The Regress Problem: Formal Analysis

College Depth 102 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
540prerequisites beneath it
See this on the map →
The Justified True Belief Account of KnowledgeFirst-Order Logic Syntax+4 more→→Justification Structures and Hierarchies
justification regress regress-argument

Core Idea

The regress problem asks: what makes a belief justified? If justification requires further justified beliefs, and those require further justification, a vicious infinite regress threatens. Formal analysis models justification as a relation between beliefs in a graph: either beliefs form infinite chains (unjustified regress), cycles (coherentism), or ground out in fundamental beliefs (foundationalism). Each structure corresponds to a different epistemological theory.

Explainer

You know from studying justified true belief (JTB) that justification is one of the central requirements for knowledge. The regress problem emerges as soon as you ask what justification is made of. Suppose you believe that it will rain (B1). What justifies B1? Your belief that the forecast says rain (B2). What justifies B2? Your belief that you reliably read weather apps (B3). What justifies B3? And so on. Using the tools of first-order logic and graph theory, we can model this as a directed graph where nodes are beliefs and edges represent "is justified by." The regress problem is a structural question about what shapes this graph can and cannot take.

There are exactly four possible structures, each corresponding to a major epistemological position. First: the graph has an infinite chain — every belief is justified by some further belief, indefinitely. This is infinitism, defended by philosophers like Peter Klein. It is consistent but counterintuitive: it seems to require that you actually possess infinitely many justifying beliefs, which seems humanly impossible. Second: the graph contains cycles — belief A is justified by B, which is justified by C, which is justified by A. This is the structure of coherentism: your belief set is justified as a mutually supporting whole rather than by an external anchor. The challenge is that any sufficiently large coherent set, including false ones, can close into cycles, raising the isolation objection: a coherent web of fiction seems no more justified than a coherent web of truths.

Third: the graph grounds out — some nodes have no incoming edges, meaning some beliefs are basic beliefs that are justified without depending on other beliefs. This is foundationalism, the dominant view in the Western tradition from Descartes onward. The challenge is to explain what makes basic beliefs justified if not further beliefs. Foundationalists typically appeal to self-evidence (the belief that p is justified by the very content of p, as in "2+2=4") or to direct experience (perceptual beliefs are justified by the experience itself, not by inferential reasoning about it). Formal analysis clarifies what foundationalism requires: the basic beliefs must have *non-inferential* justification, meaning their node in the graph has no incoming justification edges but still has positive epistemic status.

The formal framing makes clear why the regress problem is structural rather than psychological. It's not about whether people actually trace all their justifications — of course they don't. It's about what the *logical structure* of a fully justified belief system would have to look like. Any such structure must either terminate, cycle, or extend infinitely; there are no other options. The question "what is the architecture of knowledge?" reduces to asking which of these three graph structures is epistemically legitimate. Each answer generates a different theory with different commitments about what occupies the terminal nodes, how coherence generates justification, or what infinite justification chains would require.

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 → The Foundationalist Regress and Epistemic Support → The Regress Problem: Formal Analysis

Longest path: 103 steps · 540 total prerequisite topics

Prerequisites (6)

Leads To (1)