A method in modal and related logics that builds a canonical model whose worlds are maximally consistent sets (or saturated theories) of formulas and whose accessibility relations are defined from syntactic conditions; used to prove completeness theorems by establishing a truth lemma linking formulas to membership in worlds.

Principle

Use Lindenbaum-style maximization (or saturation) to extend consistent sets to maximally consistent ones, define worlds as these sets, and define relations so that modal formulas are preserved; the truth (or truth lemma) is then proved by induction on formula structure showing a formula holds at a world iff it belongs to the corresponding maximally consistent set.

Demonstration

For the normal modal logic K, start from a consistent set Γ, extend it to a maximal K-consistent set w, let the canonical frame consist of all such maximal sets, define wRv iff for every □φ ∈ w we have φ ∈ v, and prove the truth lemma to conclude that every K-valid formula is valid in the canonical model, yielding completeness.

Misapplication

Assuming the canonical model is small or has desired frame properties (e.g., finite, well-founded, or satisfying special frame conditions) without verifying that the logic's axioms enforce those properties; incorrectly applying the construction to non-normal systems without adapting the accessibility definition.

Consequence

Yields completeness (and often correspondence) results: if a formula is not provable, its negation is consistent and extends to a world in the canonical model that falsifies the formula, producing a countermodel; also clarifies connections between syntactic axioms and semantic frame conditions.

Reversal

Contrast with direct model-building or filtration: canonical models are syntactic and potentially large or non-finite, whereas filtration produces finite approximations preserving truth for a bounded language — reversing between them trades general completeness for finiteness or decidability properties.

Boundary

Effective for normal modal logics and many related systems where maximal consistent sets and the defined accessibility satisfy required properties; fails or needs modification for logics without a workable maximization lemma, for certain non-normal logics, or when one needs finite model properties without further techniques.

Semantic Tension

Tension with filtration and bisimulation-generated models: canonical models are maximally syntactic and often non-finite; filtration aims at finite models preserving specific formulas, and bisimulation methods capture modal invariance — choosing among them depends on whether one needs completeness, finiteness, or invariance.

Synthesis

Canonical model construction turns syntactic consistency into semantic countermodels by packaging maximally consistent sets as worlds and encoding modal operators in accessibility relations; the truth lemma then links syntax and semantics, yielding completeness and clarifying how axioms constrain frames.