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

Epistemic Properties and Metrics

College Depth 98 in the knowledge graph I know this Set as goal
10topics build on this
525prerequisites beneath it
See this on the map →
Formal Epistemology: IntroductionEpistemic Accessibility RelationsMemory and Epistemic Justification
properties measurement coherence reliability

Core Idea

Formal epistemology quantifies epistemic properties: coherence as a measure of mutual support among beliefs, reliability as the frequency of true outputs, epistemic utility as a function mapping belief-states to numbers, informativeness as variance in posterior distributions. These metrics enable precise comparison of theories and discovery of trade-offs. For instance, maximizing coherence may lower reliability; balancing these trade-offs requires explicit utility functions.

Explainer

From your introduction to formal epistemology, you are already comfortable using probability theory to represent degrees of belief and Bayesian updating to revise beliefs in response to evidence. Now we are extending that framework to ask a more evaluative question: not just "how should I update?" but "how good is my epistemic state, and how can we measure it?"

Coherence is the first major metric. Intuitively, a coherent set of beliefs mutually support each other — believing P is more plausible given the rest of your beliefs than it would be in isolation. Formal measures of coherence (such as Shogenji's measure or Olsson's average pairwise confirmation) capture this as ratios of joint probabilities to products of individual probabilities. A perfectly incoherent set of beliefs is one where each belief is independent of all the others; a highly coherent set is one where each belief raises the probability of the others. Coherence is attractive as an epistemic goal because it reflects a kind of internal rationality — your beliefs fit together. But here is the first trade-off: a body of beliefs can be highly coherent while being systematically false. A conspiracy theory can be remarkably coherent while being disconnected from reality.

This is where reliability enters as a competing metric. A belief-forming process is reliable if it tends to produce true beliefs — its track record of accuracy is high. A highly coherent but unreliable system (think: a very internally consistent but empirically false worldview) fails the reliability test. Conversely, a reliable process might produce individual beliefs that don't hang together neatly. The tension between coherentist and reliabilist ideals is not merely theoretical — it maps onto the practical question of whether to trust a source that is consistent but unchecked versus one that is accurate but unsystematic.

Epistemic utility functions generalize this further. A utility function assigns a numerical score to any belief-state — not just "true" or "false" but a graded measure of how good the state is, combining accuracy, calibration, and informativeness. The most widely studied class is strictly proper scoring rules: scoring rules where the strategy that maximizes expected utility is always to report your true credences, not to hedge or overstate confidence. The Brier score and logarithmic scoring rule are examples. These tools matter because they make it possible to formally compare epistemic theories — if theory A consistently achieves higher expected utility than theory B under a proper scoring rule, that is a precise argument in its favor. The trade-off structure becomes explicit: informativeness (a tightly peaked posterior that commits to a specific prediction) and calibration (being right at the stated confidence level) can pull in opposite directions, and epistemic utility functions let us quantify exactly how to balance them.

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 LogicFormal Epistemology: IntroductionEpistemic Properties and Metrics

Longest path: 99 steps · 525 total prerequisite topics

Prerequisites (1)

Leads To (2)