A model-theoretic construction in modal logic that quotients a (possibly infinite) Kripke model by an equivalence defined from a finite set of formulas so that the resulting finite quotient (the filtration) preserves the truth of every formula in that finite set, enabling finite-model arguments for satisfiability and completeness.

Principle

Partition states by their valuations on the relevant finite set of subformulas and collapse equivalent states into equivalence classes, defining successor relations between classes to preserve satisfiability of the chosen formulas while reducing the model size.

Demonstration

To prove the finite model property for a normal modal logic on a restricted class of frames, take a model satisfying a formula, collect the finite set of subformulas, build the filtration equivalence over states that agree on those subformulas, and form the quotient model which is finite and still satisfies the original formula.

Misapplication

Assuming a filtration preserves truth of formulas outside the chosen subformula set, or applying standard filtration without accounting for frame conditions (such as transitivity or symmetry) that the quotient may violate, leading to incorrect completeness or frame-preservation claims.

Consequence

When valid, filtration yields finite models for satisfiable formulas (finite model property), simplifies completeness proofs by reducing canonical models to finite quotients, and gives algorithmic finite witnesses for satisfiability in many modal systems.

Reversal

The inverse idea is unravelling (tree unravelling) which transforms a model into a tree-like structure preserving local truths but possibly expanding it; reversal highlights trade-offs between collapsing for finiteness and expanding for tree-like regularity.

Boundary

Filtration is tied to a chosen finite formula set and to logics where subformula preservation and frame properties are compatible with quotienting; it may fail or require modification for logics with global modalities, fixed-point operators, hybrid features, or when frame conditions are not preserved by quotient.

Semantic Tension

Tension occurs between using filtration to obtain small canonical models and using automata-theoretic or algebraic methods that avoid model collapsing; also between preserving syntactic subformula truth and losing other semantic frame constraints in the quotient.

Synthesis

The Filtration Method collapses a model along equivalence induced by a finite formula set to produce a smaller model preserving those formulas' truth; it is a concrete, semantic way to achieve finite-model results and constructive satisfiability witnesses, subject to careful handling of frame conditions and language features.