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

Craig-Lyndon Interpolation Theorem

College Depth 91 in the knowledge graph I know this Set as goal
2topics build on this
457prerequisites beneath it
See this on the map →
Logical Consequence and EntailmentCraig Interpolation TheoremBeth Definability: From Implicit to Explicit Definitions
Craig interpolation interpolant consequence

Core Idea

If φ → ψ is a tautology, there exists an interpolant θ (using only symbols common to φ and ψ) such that φ → θ and θ → ψ are both tautologies. The Lyndon version strengthens this: the interpolant can be chosen to preserve the direction of implications in formulas. Interpolation theorems are fundamental for studying definability and relationships between formulas.

Explainer

You already understand Craig interpolation from your prerequisite: when φ logically entails ψ, there is an interpolant θ using only the vocabulary shared by both, with φ ⊨ θ and θ ⊨ ψ. The Craig-Lyndon theorem refines this result by imposing an additional constraint on the interpolant — one that encodes not just *which* predicate symbols appear, but *how* they appear directionally.

The Lyndon strengthening concerns polarity. In a formula, a predicate symbol can appear positively (in a context where increasing its extension can only help the formula hold — for instance, not under any negation), negatively (where decreasing its extension helps), or both. The Lyndon refinement says the interpolant θ can be chosen so that any predicate occurring positively in θ occurs positively in both φ and ψ, and any predicate occurring negatively in θ occurs negatively in both. This is a strictly stronger claim than bare Craig interpolation: the vocabulary constraint remains, but now the *directional role* of each shared symbol is also preserved.

Why does this refinement matter? In formal verification, modal logic, and definability theory, polarity carries semantic weight: a predicate appearing only positively is monotone in that position. The Lyndon version guarantees that the interpolant's logical structure mirrors the polarity structure of the original entailment, which enables stronger applications. For example, the Lyndon version implies sharper definability results than Craig's version alone — when constructing an explicit definition from an implicit one, the definition can be chosen with controlled monotonicity properties.

Both versions connect to Beth definability: if a theory implicitly defines a predicate (its extension is uniquely determined by the rest of the theory in any model), then that predicate is explicitly definable using the theory's existing vocabulary. The Craig-Lyndon version strengthens this: the explicit definition can be chosen with controlled polarity. Together, these results reveal that the vocabulary-mediated structure of logical entailment is not arbitrary — there is always a principled "common content" mediating any entailment, and its internal directional structure can be isolated and expressed precisely.

Practice Questions 5 questions

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 EntailmentSatisfiability and UnsatisfiabilityConsistency and Inconsistency of TheoriesConsistency and InconsistencyBasic Model TheoryCraig Interpolation TheoremCraig-Lyndon Interpolation Theorem

Longest path: 92 steps · 457 total prerequisite topics

Prerequisites (2)

Leads To (1)