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

Fallibilism and Justified Belief

College Depth 102 in the knowledge graph ☐ I know this ☆ Set as goal
548prerequisites beneath it
See this on the map →
What Is Knowledge?Process Reliabilism+1 more→
fallibilism reliability error-tolerance knowledge

Core Idea

Fallibilism permits knowledge despite the possibility of error—one can know a proposition even though one could, under different circumstances, have been mistaken about it. This preserves the intuition that ordinary empirical knowledge is genuine while acknowledging human fallibility. Fallibilism requires specifying what degree of reliability or justification suffices for knowledge when infallibility is impossible, making it the dominant view in contemporary epistemology.

How It's Best Learned

Examine ordinary cases of knowledge despite acknowledged fallibility: knowing who won yesterday's game despite potential error in memory, knowing scientific facts despite potential revision. Specify what degree of justification suffices.

Common Misconceptions

Explainer

You have already wrestled with the question of what knowledge requires — justified true belief at minimum, and something more to close Gettier cases. One implicit assumption in many classical formulations is that genuine knowledge requires infallibility: if you truly know P, then you could not possibly be wrong about P. This sounds intuitive at first. But consider what it would mean in practice. Do you know what you had for breakfast this morning? You could be misremembering. Do you know that the sun will rise tomorrow? You could be wrong about the laws of physics. Do you know that your friend is named what she says she is named? You could be being deceived. If infallibility is required for knowledge, almost nothing qualifies — a conclusion so extreme that it drives many epistemologists toward fallibilism.

Fallibilism makes the more moderate claim: knowledge is compatible with the mere logical possibility of error. You can know P even though, in some nearby or not-so-nearby possible world, you would have been wrong about P. What matters is not that error is impossible but that your belief-forming process is reliable enough in actual conditions — that it produces true beliefs with sufficient regularity in the kinds of circumstances you actually inhabit. Your memory is generally reliable about recent events, your perceptual faculties about nearby objects under normal lighting. That reliability suffices for knowledge even though neither is infallible.

This connects directly to your prerequisite study of reliabilism. Reliabilist accounts of justification hold that a belief is justified when it is produced by a reliable cognitive process. Fallibilism complements this view: if reliability (not infallibility) is the standard for justification, then knowledge through reliable-but-fallible processes is genuine knowledge. The key move is distinguishing two different senses of "could be wrong": (a) there exists some logically possible world where I am wrong, and (b) in the actual conditions of my current situation, my belief-forming process is likely to have gone wrong. Fallibilism permits (a) while still requiring that (b) be false. You can know something while acknowledging logical possibility of error; you cannot know something when your process is actually unreliable.

The practical upshot is that ordinary empirical knowledge — the kind we rely on in science, daily life, and decision-making — is vindicated. Fallibilism is the dominant position in contemporary epistemology precisely because it preserves the intuition that we genuinely know many things while honestly acknowledging that human cognition is not perfect. The philosophical challenge it faces is specifying the threshold: exactly how reliable must a process be? This boundary problem is real, but it is a problem about drawing a precise line, not a reason to think there is no difference between knowledge and lucky guessing.

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 → Fallibilism and Justified Belief

Longest path: 103 steps · 548 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.