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

The Factive Knowledge Operator

Graduate Depth 117 in the knowledge graph I know this Set as goal
768prerequisites beneath it
See this on the map →
Knowledge and Belief OperatorsIntroduction to Modal Logic
factivity knowledge-truth operator-properties

Core Idea

Knowledge is factive: if one knows p, then p is true. In epistemic logic, this is the axiom Kₐp → p, which distinguishes knowledge from mere belief (Bₐp does not entail p). Factivity reflects the intuition that you cannot be wrong about what you know—false knowledge is a contradiction. Formally, factivity ensures that the accessibility relation R is reflexive: every world is accessible to itself, so truth in the actual world implies truth in accessible worlds.

Explainer

From your study of knowledge and belief operators, you know that epistemic logic formalizes reasoning about what agents know and believe, using operators K (knowledge) and B (belief). The factive knowledge operator introduces the single most important asymmetry between these two: knowledge, unlike belief, guarantees truth. This is captured in the axiom Kₐp → p: if agent *a* knows proposition *p*, then *p* is true. Belief carries no such guarantee: Bₐp (agent *a* believes *p*) can be true even when *p* is false.

The factivity of knowledge is deeply embedded in ordinary language. When you say "I know it's raining," you are not merely reporting a mental state — you are committing to the rain being real. If it turns out it's not raining, the natural response is not "I was wrong about knowing" but "I didn't know then, I just thought I knew." This is why we say things like "She thought she knew, but she was mistaken" — the phrase makes sense. But "She knew, but she was mistaken" is a contradiction. Knowledge-claims function as guarantees in a way that belief-claims do not. In J.L. Austin's terms, "I know" performs a kind of epistemic warranty, not just a description of inner mental state.

In modal logic terms, you know that possible worlds are connected by accessibility relations: world *w* accesses world *v* if *v* is epistemically possible from *w*. Factivity corresponds to a reflexive accessibility relation: every world accesses itself. Why? If Kₐp means "p is true in all worlds epistemically accessible to agent *a* from the actual world," then for Kₐp → p to hold, the actual world must itself be accessible. In other words, the agent's epistemic possibilities must include the actual world — you cannot "know" something while counting the actual world as an impossible scenario. Reflexivity of R is the formal guarantee of this: R is reflexive iff every world w satisfies wRw, which ensures that anything true in all accessible worlds is true in the actual world too.

The factivity axiom has significant consequences for the analysis of knowledge. It immediately rules out a certain naive view of knowledge as "very confident belief." Someone who is supremely confident but wrong does not know — confidence is a psychological state that can be present whether or not the believed proposition is true. It also makes Gettier cases so philosophically important: Gettier showed that justified true belief is not sufficient for knowledge — but factivity ensures it is necessary. A Gettier case is specifically one where the truth condition is met (the proposition is true), justification is present, but knowledge is still absent — which shows that truth and justification together do not close the gap between belief and knowledge. Factivity is the necessary but not sufficient condition: knowledge entails truth, but truth plus good evidence does not automatically produce knowledge.

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. EmpiricismThe Problem of InductionPopper's FalsificationismFalsifiability as the Criterion of DemarcationThe Falsifiability Criterion and Its ProblemsKuhn's Paradigm TheoryNormal Science and AnomaliesThomas Kuhn and Paradigm ShiftsScientific Progress and Convergence to TruthScientific RealismNaturalism About Semantic FactsPropositions and Semantic ContentTruth Conditions and MeaningFormal Language and Natural Language SemanticsTwo-Dimensional SemanticsModal Semantics and Possible WorldsPossible Worlds Semantics for KnowledgeEpistemic Accessibility RelationsKnowledge and Belief OperatorsThe Factive Knowledge Operator

Longest path: 118 steps · 768 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.