Finite Modal Depth Property

• Finite Modal Depth Property is a finiteness condition that guarantees a uniform finite bound on the modal nesting required to express formulas up to logical equivalence.
• It relates syntactic notions like formula depth with semantic conditions such as bounded frame height, finite rank, and local tabularity, leading to finite countermodel constructions.
• This property has significant implications in dynamic epistemic logic, constructive modal systems, and modal μ-calculus by stabilizing modal behavior after finitely many layers.

Searching arXiv for recent and foundational papers on finite modal depth, local tabularity, and bounded-depth semantics. The finite modal depth property is a finiteness condition on modal expressivity stating that there exists a uniform finite bound on the modal depth needed to represent formulas up to logical equivalence. In the most explicit formulation, for a modal logic $L$, one sets

$$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$

and says that $L$ has the finite modal depth property when $\mathsf{md}(L)<\omega$ (Shapirovsky, 22 Sep 2025). The phrase is not fully uniform across the literature: in some settings it is tied to local tabularity, in others to bounded frame height, bounded rank, shallow model properties, or finite approximants for fixed-point iteration. Across these formulations, the recurring theme is that modal behavior stabilizes after finitely many layers, syntactically or semantically, and this stabilization often yields strong consequences such as local tabularity, finite model constructions, and explicit bounded-depth countermodels (Shapirovsky, 22 Sep 2025, Takahashi, 24 Nov 2025).

1. Definition and basic formulations

The syntactic notion of modal depth is standard: $\mathsf{md}(p)=0$ for propositional variables, $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$, $$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$, and $\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$, with analogous clauses for other unary modalities (Shapirovsky, 22 Sep 2025). What is specific to the finite modal depth property is not the depth of an individual formula but the global bound on how much depth is ever needed modulo $L$-equivalence: $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$ This formulation makes the property a genuine compression principle: arbitrarily complex formulas become equivalent, over $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$0, to formulas from a bounded-depth fragment (Shapirovsky, 22 Sep 2025).

A semantically parallel formulation is available for classes of frames. For a frame $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$1, one defines, from any finite family $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$2, a sequence of equivalences $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$3 by closing $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$4 under inverse images $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$5. The modal depth $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$6 is the least stage at which this refinement process stabilizes uniformly over all finite $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$7, and for classes $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$8 one sets $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$9 (Shapirovsky, 22 Sep 2025). When $L$0 is closed under countable disjoint sums and $L$1, one has

$L$2

so the logical and frame-theoretic notions coincide in that setting (Shapirovsky, 22 Sep 2025).

Several papers use adjacent but not identical notions. The finite model property says that every non-theorem has a finite countermodel. Finite height says that there is a bound $L$3 on the height of frame skeletons. Local tabularity says that over each finite variable set there are only finitely many formulas up to equivalence. The literature repeatedly places the finite modal depth property among these stronger finiteness principles rather than treating it as merely another name for them (Shapirovsky, 22 Sep 2025, Cate et al., 2022).

2. Finite height, local tabularity, and structural criteria

The strongest systematic connection established in the recent literature is that finite modal depth implies local tabularity: $L$4 The reason is that, once both the variable set and the maximal modal depth are bounded, only finitely many formulas remain up to equivalence (Shapirovsky, 22 Sep 2025). The converse is not known in general. The open problem is stated explicitly: does local tabularity imply finite modal depth? The same source notes that above $L$5, local tabularity and finite modal depth are equivalent (Shapirovsky, 22 Sep 2025).

Frame height enters through the skeleton construction. For a polymodal frame $L$6, let $L$7, $L$8 its reflexive-transitive closure, and $L$9 the cluster equivalence induced by mutual $\mathsf{md}(L)<\omega$0-reachability. The quotient poset $\mathsf{md}(L)<\omega$1 is the skeleton, and the height $\mathsf{md}(L)<\omega$2 is the supremum of finite chain lengths in that poset (Shapirovsky, 22 Sep 2025). In the transitive unimodal case, Segerberg’s finite-height formulas

$\mathsf{md}(L)<\omega$3

characterize bounded height: $\mathsf{md}(L)<\omega$4 Accordingly, a transitive unimodal logic $\mathsf{md}(L)<\omega$5 is locally tabular iff $\mathsf{md}(L)<\omega$6 for some finite $\mathsf{md}(L)<\omega$7 (Shapirovsky, 22 Sep 2025).

For pretransitive logics, the same pattern reappears after relativizing to the reflexive-transitive closure encoded by $\mathsf{md}(L)<\omega$8. If $\mathsf{md}(L)<\omega$9 is pretransitive with transitivity index $\mathsf{md}(p)=0$0, then suitable formulas $\mathsf{md}(p)=0$1 satisfy

$\mathsf{md}(p)=0$2

Moreover, local tabularity forces both pretransitivity and finite height (Shapirovsky, 22 Sep 2025).

The most general structural criterion currently available is the cluster criterion for finite modal depth. If $\mathsf{md}(p)=0$3 is a class of frames of finite height $\mathsf{md}(p)=0$4, $\mathsf{md}(p)=0$5 is the modal depth of the logic of the cluster frames, and $\mathsf{md}(p)=0$6 is the transitivity index, then

$\mathsf{md}(p)=0$7

Consequently, if the cluster logic has finite modal depth, then finite height is equivalent to finite modal depth for the whole class (Shapirovsky, 22 Sep 2025). This recovers the transitive unimodal case and extends it to non-transitive and polymodal families.

3. Semantic bounded depth: rank, finite height, and finite countermodels

A distinct but closely related use of the bounded-depth idea appears in the finite-model construction of "Chopping More Finely" (Takahashi, 24 Nov 2025). There the central formal notion is the finite model property, but the underlying combinatorics is explicitly controlled by frame rank and algebraic height. For a modal space $\mathsf{md}(p)=0$8, the rank of a point is defined by

$\mathsf{md}(p)=0$9

that is, the length of the longest $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$0-path starting at $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$1 (Takahashi, 24 Nov 2025). On finite modal spaces, the following are equivalent: cycle-freeness, finite rank at every point, and a global finite bound $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$2 with $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$3 for all $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$4 (Takahashi, 24 Nov 2025). This makes rank a frame-theoretic surrogate for bounded modal depth.

The algebraic counterpart is finite height. A modal algebra $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$5 has height $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$6 iff

$\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$7

For finite algebras, finite height is equivalent to cycle-freeness of the dual space (Takahashi, 24 Nov 2025). This equivalence is exactly the semantic identification of bounded modal depth with bounded path length.

The Subdivision Construction then converts arbitrary countermodels into finite ones by refining a finite target space along rank layers. Given a stable surjection $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$8 satisfying a closed domain condition, the construction yields a finite refinement $\mathsf{md}(\neg\varphi)=\mathsf{md}(\varphi)$9 and maps

$$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$0

such that $$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$1 is a p-morphism at every finite-rank point: $$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$2 Points of infinite rank remain unchanged under $$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$3, while the finite-rank part is subdivided inductively by rank $$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$4 (Takahashi, 24 Nov 2025). The finite bound $$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$5 is provided by finite height of the algebra or cycle-freeness of the frame. This suggests a semantic formulation of the finite modal depth property as the existence, for each counterexample, of a finite countermodel whose relevant behavior is fully determined below some bounded rank.

Older filtration-based results on pretransitive logics of finite height exhibit the same pattern. For $$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$6-transitive frames, pretransitivity

$$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$7

collapses long reachability chains, while finite frame height bounds the number of skeleton layers. Special filtrations and correct partitions then produce finite countermodels in classes $$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$8, $$\mathsf{md}(\varphi\land\psi)=\max(\mathsf{md}(\varphi),\mathsf{md}(\psi))$$9, and related families (Kudinov et al., 2015). Although those results are phrased in terms of finite approximability and decidability, the mechanism again consists of replacing an arbitrary model by one whose semantically relevant path structure is bounded.

4. Finite characterizations, exact learnability, and local tabularity

The finite modal depth property also appears in a semantic-combinatorial form through finite characterizations of formulas. A finite characterization of $\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$0 with respect to a modal language is a pair of finite sets of finite pointed models

$\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$1

such that $\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$2 is true on all positive examples, false on all negative examples, and uniquely determined up to equivalence by that behavior (Cate et al., 2022). For a normal modal logic $\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$3, the definition relativizes to finite pointed models based on $\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$4-frames and equivalence modulo $\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$5 (Cate et al., 2022).

The decisive theorem is: $\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$6 Thus finite characterizability for the full modal language is possible exactly when the logic has the finitary behavior associated with local tabularity (Cate et al., 2022). Since finite modal depth implies local tabularity, finite modal depth is sufficient for finite characterizability. The converse remains open because local tabularity itself may or may not imply finite modal depth in general (Shapirovsky, 22 Sep 2025).

The negative direction is witnessed by formulas that distinguish exact frame heights. In $\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$7, formulas such as

$\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$8

express that a pointed model has height exactly $\mathsf{md}(\Box\varphi)=1+\mathsf{md}(\varphi)$9 (Cate et al., 2022). Any finite set of finite examples has bounded height, so for sufficiently large $L$0 one can build a formula agreeing with a target such as $L$1 on that sample but differing globally. This is why the full modal language of $L$2 is not finitely characterizable (Cate et al., 2022). The obstruction is precisely the existence of infinitely many inequivalent formulas at increasing modal depths.

A notable positive exception is the positive modal language without $L$3 and $L$4. That fragment is finitely characterizable, even over $L$5, via preservation under weak simulations (Cate et al., 2022). The paper does not phrase this as finite modal depth, but the mechanism is depth-sensitive: the finite examples capture all behavior relevant to formulas up to their modal complexity, and the absence of $L$6 blocks the height-sensitive constructions used in the negative results. This suggests that bounded-depth behavior can re-emerge at the fragment level even when the ambient logic is not locally tabular.

5. Dynamic, constructive, and fixed-point extensions

In dynamic epistemic logic, the finite modal depth property becomes an explicit semantic resource. DBEL defines modal depth inductively by

$L$7

and equips each state with agent-specific depth budgets $L$8 (Arthaud et al., 2023). Bounded knowledge is then defined by

$L$9

so an agent knows $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$0 only if its depth is at least the modal depth of $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$1 (Arthaud et al., 2023). In this setting the finite modal depth property is not merely a meta-theorem about expressivity; it is part of the semantics. Introspection axioms become depth-sensitive, and public announcements consume depth in DPAL. The muddy children analysis yields explicit upper and lower bounds: solving the puzzle with $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$2 muddy children requires depth $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$3, and depth $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$4 is sufficient under the appropriate hierarchy of depth knowledge (Arthaud et al., 2023).

Constructive modal logics provide another operational incarnation. For $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$5, $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$6, and $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$7, the finite model proofs are driven by a shallow model property: every non-theorem has a countermodel in which the strict $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$8-chains have length bounded by the size of the chosen finite set of subformulas $$\exists D<\omega\;\forall\varphi\;\exists\psi\;\bigl(L\vdash \varphi\leftrightarrow\psi \text{ and } \mathsf{md}(\psi)\le D\bigr).$$9, hence by $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$00 (Balbiani et al., 2021). The bounded chain length is then combined with a $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$01-bisimulation quotient to obtain finite countermodels. The same structural pattern appears in the birelational finite frame property for $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$02 and related logics: formula falsifiability is reduced to shallow frames, and shallowness is converted into finiteness by a quotient construction (Balbiani et al., 2024). A plausible implication is that, in constructive settings, “finite modal depth” is often realized as bounded intuitionistic height rather than bounded ordinary modal nesting.

For the modal $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$03-calculus, the relevant notion is no longer formula depth but closure ordinal. In the $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$04-fragment, every countable ordinal below $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$05 occurs as a closure ordinal, and no larger countable ordinal does: $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$06 Equivalently, $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$07 strictly bounds the iterations required for modal definable functions to reach a fixed point across all countable structures (Afshari et al., 4 Nov 2025). This is an ordinal-valued analogue of finite modal depth: recursion depth is not finite in the natural-number sense, but it is globally bounded in the countable ordinal hierarchy.

A contrasting phenomenon appears in multimodal $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$08-calculi over fusion logics. There the alternation hierarchy is strict over broad non-trivial fusions, so no finite alternation-depth bound exists in general (Pacheco, 4 Nov 2025). By contrast, in GLP and IS5 the $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$09-calculus collapses to modal logic, which is a strong form of finite modal depth at the fixed-point level (Pacheco, 4 Nov 2025). This identifies a sharp boundary: structural interaction between modalities can destroy any global depth bound, while strong internal constraints can force a collapse to bounded-depth modal behavior.

6. Consequences, limitations, and open problems

Finite modal depth has immediate proof-theoretic and model-theoretic consequences. It implies local tabularity, hence strong finiteness of formula equivalence classes over finite signatures (Shapirovsky, 22 Sep 2025). In many settings it feeds into finite model constructions: bounded frame height, bounded rank, shallow models, and filtration all turn bounded-depth behavior into finite countermodels (Takahashi, 24 Nov 2025, Kudinov et al., 2015, Balbiani et al., 2021). In epistemic and dynamic settings it yields exact resource bounds for agents’ reasoning (Arthaud et al., 2023).

It does not coincide uniformly with the finite model property. A logic may have finite model property without any known global bound on modal depth, and conversely finite modal depth is strictly stronger than what is needed for mere finite countermodels. The strongest current general implication is

$$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$10

while the converse remains open outside classes such as transitive unimodal logics above $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$11 (Shapirovsky, 22 Sep 2025).

It also does not guarantee tractable algorithms in any naive sense. In parameterized modal satisfiability for $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$12, satisfiability is fixed-parameter tractable in the number of propositional variables $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$13 and formula modal depth $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$14, but the dependence on $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$15 is a tower of exponentials; this dependence cannot be substantially improved unless $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$16 (0912.4941). That result concerns depth of individual formulas rather than finite modal depth of whole logics, but it shows that bounded depth alone need not tame combinatorial explosion.

Several open directions remain. The most explicit is the unresolved implication from local tabularity to finite modal depth (Shapirovsky, 22 Sep 2025). A second concerns fixed-point logics: the exact closure-ordinal bounds beyond the $$\mathsf{md}_L(\varphi)=\min\{\mathsf{md}(\psi)\mid L\vdash \varphi\leftrightarrow \psi\}, \qquad \mathsf{md}(L)=\sup\{\mathsf{md}_L(\varphi)\mid \varphi\text{ a formula}\},$$17-fragment and the preservation of such bounds under syntactic transformations remain open (Afshari et al., 4 Nov 2025). A third concerns multimodal settings, where strict alternation hierarchies indicate that finite modal depth may fail dramatically even when unimodal fragments collapse (Pacheco, 4 Nov 2025).

Taken together, the literature presents the finite modal depth property as a unifying principle rather than a single invariant. At the syntactic level it bounds the depth needed for equivalence; at the frame level it appears as finite height, rank, or stabilization of tuned partitions; in proof theory it underlies local tabularity; in model theory it supports finite countermodels; in dynamic and constructive settings it becomes a resource-sensitive semantics; and in fixed-point logic it lifts to ordinal bounds on recursion. The common content is that modal complexity stabilizes after finitely many layers, whether those layers are measured by nesting depth, frame height, rank, or closure ordinal.