Blok's Dichotomy Theorem

• Blok's Dichotomy Theorem is a foundational result in modal and tense logics, showing that a normal logic’s frame equivalence class has size either 1 or 2^ℵ0.
• The theorem distinguishes strictly Kripke-complete logics—characterized by iterated splittings—from those that share their validating frames with continuum many distinct logics.
• Its generalization to tense logics demonstrates that temporal modalities and refined frame constructions preserve the continuum dichotomy across different logical lattices.

Searching arXiv for the cited paper and closely related context. Search query: title:"Degree of Kripke-incompleteness of Tense Logics" Blok's Dichotomy Theorem is a result about the semantic indistinguishability of logics under Kripke semantics. In its classical form, for every normal modal logic $L\in\mathsf{NExt}(\mathsf{K})$, the number of logics with exactly the same validating Kripke frames as $L$ is either $1$ or $2^{\aleph_0}$. The theorem thus partitions normal modal logics into those whose Kripke semantics determines them uniquely and those that belong to a continuum-sized equivalence class under frame semantics. In the tense setting, the theorem has been generalized to the lattices $\mathsf{NExt}(\mathsf{K}_t)$, $\mathsf{NExt}(\mathsf{K4}_t)$, and $\mathsf{NExt}(\mathsf{S4}_t)$, where the same dichotomy holds and where iterated splittings characterize the degree-$1$ cases (Chen, 6 Jul 2025).

1. Formal setting and semantic degree

Blok's dichotomy concerns the relation between a logic and the class of Kripke frames validating it. In the tense framework considered in "Degree of Kripke-incompleteness of Tense Logics" (Chen, 6 Jul 2025), a frame is a pair $F=(X,R)$ where $X$ is a nonempty set and $L$0, while a general frame is a triple $L$1 with $L$2 closed under $L$3, complementation, $L$4, and $L$5. The language is bimodal, with future and past tense operators, and validity is defined in the usual way via valuations into admissible sets (Chen, 6 Jul 2025).

For a tense logic $L$6, Kripke completeness means $L$7, and the finite model property means $L$8. General-frame completeness holds uniformly: every tense logic is complete with respect to its class of general frames, and also with respect to its rooted general frames (Chen, 6 Jul 2025). This separates the ubiquitous completeness of tense logics for general frames from the much more delicate issue of completeness for ordinary Kripke frames.

The central quantitative invariant is the degree of Kripke-incompleteness. For a lattice $L$9 of logics and $1$0, the degree is defined by

$1$1

Equivalently, it is the cardinality of the equivalence class of $1$2 under the relation $1$3 (Chen, 6 Jul 2025). A logic is strictly Kripke-complete in $1$4 exactly when this degree is $1$5. The paper also defines the analogous degree for the finite model property,

$1$6

and shows that in the tense lattices studied, $1$7 (Chen, 6 Jul 2025).

The conceptual content of the dichotomy is therefore stark. Either frame semantics determines a logic uniquely, or frame semantics leaves room for continuum many distinct logics with exactly the same validating frames.

2. Classical theorem in modal logic

The classical theorem recalled in the tense generalization states that every modal logic $1$8 has degree of Kripke-incompleteness either $1$9 or $2^{\aleph_0}$0 (Chen, 6 Jul 2025). Thus, within the lattice of normal extensions of $2^{\aleph_0}$1, there are no intermediate cardinalities for frame-semantic equivalence classes.

In this formulation, degree $2^{\aleph_0}$2 means that the logic is strictly Kripke-complete: among all normal modal logics, exactly one logic has its frame class. Degree $2^{\aleph_0}$3 means that there is a continuum of pairwise distinct normal modal logics sharing that same frame class (Chen, 6 Jul 2025). A plausible implication is that Kripke semantics is maximally discriminating on one part of the lattice and maximally non-discriminating on the remainder.

The paper attributes the original proof to Blok (1978), who worked algebraically in $2^{\aleph_0}$4. In that setting, union-splittings are exactly the consistent strictly Kripke-complete logics, while every other consistent logic has degree $2^{\aleph_0}$5 (Chen, 6 Jul 2025). Another proof, based on relational semantics, is due to Chagrov–Zakharyaschev (1997, §10.5), also as reported there. The result is often regarded as a canonical theorem on Kripke-incompleteness because it connects a semantic phenomenon to a precise lattice-theoretic structure.

The tense generalization preserves the dichotomous cardinal structure but modifies the structural criterion for the degree-$2^{\aleph_0}$6 side. In particular, for $2^{\aleph_0}$7, the classical identification of degree $2^{\aleph_0}$8 with union-splitting does not persist unchanged (Chen, 6 Jul 2025).

3. Splittings, union-splittings, and iterated splittings

The structural notions governing the theorem are splitting, union-splitting, and iterated splitting. For a base logic $2^{\aleph_0}$9 and $\mathsf{NExt}(\mathsf{K}_t)$0, the pair $\mathsf{NExt}(\mathsf{K}_t)$1 is a splitting pair in $\mathsf{NExt}(\mathsf{K}_t)$2 if for every $\mathsf{NExt}(\mathsf{K}_t)$3, exactly one of $\mathsf{NExt}(\mathsf{K}_t)$4 and $\mathsf{NExt}(\mathsf{K}_t)$5 holds (Chen, 6 Jul 2025). In that case $\mathsf{NExt}(\mathsf{K}_t)$6 splits the lattice and $\mathsf{NExt}(\mathsf{K}_t)$7 is the corresponding splitting logic $\mathsf{NExt}(\mathsf{K}_t)$8.

A union-splitting in $\mathsf{NExt}(\mathsf{K}_t)$9 is a logic expressible as a join of splittings. An iterated splitting is obtained by successive applications of the splitting operation: $\mathsf{NExt}(\mathsf{K4}_t)$0 where each $\mathsf{NExt}(\mathsf{K4}_t)$1 splits the appropriate residual lattice; the definition also counts $\mathsf{NExt}(\mathsf{K4}_t)$2 itself as an iterated splitting (Chen, 6 Jul 2025). These notions are not merely syntactic. The underlying lattice theory states that an element splits the lattice iff it is completely $\mathsf{NExt}(\mathsf{K4}_t)$3-prime, and an element is a splitting iff it is completely $\mathsf{NExt}(\mathsf{K4}_t)$4-prime (Chen, 6 Jul 2025).

In the classical modal case, union-splittings characterize the degree-$\mathsf{NExt}(\mathsf{K4}_t)$5 logics. In the tense setting, the picture is more nuanced. For $\mathsf{NExt}(\mathsf{K4}_t)$6 and $\mathsf{NExt}(\mathsf{K4}_t)$7, iterated splittings coincide with union-splittings and with the strictly Kripke-complete logics. For $\mathsf{NExt}(\mathsf{K4}_t)$8, by contrast, iterated splittings still characterize strict Kripke-completeness, but union-splittings do not capture all degree-$\mathsf{NExt}(\mathsf{K4}_t)$9 cases (Chen, 6 Jul 2025).

This shift is one of the principal conceptual refinements in the tense generalization. It suggests that iterated splitting is the structurally stable notion behind strict Kripke-completeness once one moves from unimodal to bimodal tense lattices.

4. Tense-logical generalization

The main theorem of "Degree of Kripke-incompleteness of Tense Logics" is that Blok's dichotomy extends from $\mathsf{NExt}(\mathsf{S4}_t)$0 to three lattices of tense logics: $\mathsf{NExt}(\mathsf{S4}_t)$1, $\mathsf{NExt}(\mathsf{S4}_t)$2, and $\mathsf{NExt}(\mathsf{S4}_t)$3 (Chen, 6 Jul 2025). In each case, every logic has degree either $\mathsf{NExt}(\mathsf{S4}_t)$4 or $\mathsf{NExt}(\mathsf{S4}_t)$5, and in each case the degree of Kripke-incompleteness coincides with the corresponding finite-model degree.

The main characterizations can be organized as follows.

Lattice	Degree-$\mathsf{NExt}(\mathsf{S4}_t)$6 logics	Dichotomy
$\mathsf{NExt}(\mathsf{S4}_t)$7	exactly the union-splittings, equivalently exactly the iterated splittings	$\mathsf{NExt}(\mathsf{S4}_t)$8
$\mathsf{NExt}(\mathsf{S4}_t)$9	exactly the union-splittings, equivalently exactly the iterated splittings	$1$0
$1$1	exactly the iterated splittings	$1$2

In $1$3, Kracht's result yields a unique splitting pair: a logic $1$4 splits the lattice iff $1$5, where $1$6 is the one-point frame (Chen, 6 Jul 2025). Writing

$1$7

the paper proves $1$8, and shows that the only iterated splittings are $1$9 and $F=(X,R)$0 (Chen, 6 Jul 2025). Both have degree $F=(X,R)$1, and every other logic in the lattice has degree $F=(X,R)$2.

The same pattern holds in $F=(X,R)$3. Again there is a unique splitting pair, again one obtains a corresponding $F=(X,R)$4, and again the only iterated splittings are $F=(X,R)$5 and $F=(X,R)$6 (Chen, 6 Jul 2025). These are exactly the strictly Kripke-complete logics in the lattice.

The $F=(X,R)$7 case is more intricate. Kracht's theorem gives exactly two splitting pairs in $F=(X,R)$8: $F=(X,R)$9 and $X$0, where $X$1 is the least reflexive-transitive tense logic whose rooted frames have no nontrivial chains (Chen, 6 Jul 2025). Here the iterated splittings are precisely

$X$2

and these are exactly the degree-$X$3 logics. The paper emphasizes that only $X$4, $X$5, and $X$6 are union-splittings, so degree $X$7 is strictly broader than union-splitting in this lattice (Chen, 6 Jul 2025).

5. Proof architecture and frame constructions

The proofs combine splitting arguments for the degree-$X$8 side with continuum-size constructions for the degree-$X$9 side. The general strategy is modeled on the relational proof of Blok's theorem by Chagrov–Zakharyaschev, but it is adapted to the bimodal tense setting and to transitive and reflexive-transitive frame classes (Chen, 6 Jul 2025).

A central technical device is reflective unfolding. Given a frame $L$00 and points $L$01, the paper defines reflective unfoldings $L$02 by repeated combination of disjoint copies of $L$03. There is also a transitive variant using a transitive combination operation. The crucial property is the existence of a natural $L$04-morphism $L$05, and in the transitive case the corresponding map from $L$06 onto $L$07 (Chen, 6 Jul 2025). This permits the transfer of semantic information from the original finite rooted frame to arbitrarily large finite rooted unfoldings.

The resulting corollaries provide finite rooted frames of arbitrarily large reachability degree that preserve satisfaction of a chosen counterexample condition. If a formula is satisfiable in some finite rooted frame other than $L$08, then for each $L$09 there is a finite rooted frame with reachability degree at least $L$10 satisfying it. In the transitive setting, a corresponding statement holds for rooted non-symmetric $L$11- or $L$12-frames (Chen, 6 Jul 2025). These large-depth witnesses are then used to encode continuum many different logics without altering the Kripke frame class.

For a logic $L$13 that is not an iterated splitting, the construction proceeds by choosing a formula outside the maximal degree-$L$14 region, selecting a sufficiently deep finite rooted countermodel, and then combining it with specially designed general frames $L$15 indexed by subsets $L$16 (Chen, 6 Jul 2025). The combined general frames $L$17 yield logics

$L$18

with two key properties: $L$19 for all $L$20, yet $L$21 whenever $L$22. In the $L$23 and $L$24 cases, the coding uses formulas such as $L$25 and $L$26; in the $L$27 case, the construction is more elaborate and uses frames generalizing the Rieger–Nishimura ladder together with defining formulas $L$28 (Chen, 6 Jul 2025).

Since there are continuum many subsets $L$29, this produces continuum many pairwise distinct logics with the same frame class, giving $L$30. As the ambient lattices have cardinality at most $L$31, equality follows (Chen, 6 Jul 2025).

6. Structural consequences and comparison with the modal case

Across the three tense lattices, the general outcome is that iterated splittings are exactly the strictly Kripke-complete logics, while all other logics have degree $L$32 (Chen, 6 Jul 2025). This yields a unified Blok-type characterization for tense logics: for $L$33 and $L$34, $L$35 is strictly Kripke-complete iff $L$36 is an iterated splitting in $L$37; otherwise $L$38 (Chen, 6 Jul 2025).

The relation to the original modal theorem is twofold. First, the cardinal dichotomy itself is preserved unchanged. Second, the structural criterion for degree $L$39 is preserved exactly in the $L$40 and $L$41 lattices, where union-splittings and iterated splittings coincide. The main divergence appears in $L$42, where there are infinitely many iterated splittings inside $L$43, but only $L$44, $L$45, and $L$46 are union-splittings (Chen, 6 Jul 2025). Thus the naive transfer of the modal slogan “degree $L$47 iff union-splitting” fails in the reflexive-transitive tense setting.

The paper identifies several sources of additional difficulty in tense logic. The presence of future and past modalities creates more complex frame configurations; transitivity and reflexivity constrain the unfolding constructions; and in the $L$48 case, the logic is not finitely transitive, which complicates the use of master-modality methods and necessitates finer control over width, depth, and related frame parameters (Chen, 6 Jul 2025). The proof accordingly relies on transitivity-preserving combinations, large reachability degree, and formulas such as $L$49 for bound control (Chen, 6 Jul 2025).

A plausible implication is that the tense generalization does not merely reproduce the modal theorem in a richer syntax; it isolates which lattice-theoretic notions remain invariant under the passage from one modality to two and which do not.

7. Significance, limitations, and open questions

The theorem has three principal consequences in the tense setting. First, it extends Blok's dichotomy to major lattices of tense logics, namely $L$50, $L$51, and $L$52 (Chen, 6 Jul 2025). Second, it establishes that in these lattices the degree of Kripke-incompleteness coincides with the degree determined by finite frames: $L$53 (Chen, 6 Jul 2025). Third, it identifies iterated splitting as the robust structural marker of strict Kripke-completeness.

The result also clarifies a common misunderstanding. Kripke completeness and strict Kripke-completeness are not the same notion. A Kripke-complete logic may still fail to be uniquely determined by its validating frames, whereas strict Kripke-completeness requires semantic uniqueness within the lattice. Blok's dichotomy concerns the latter notion, measured via the size of the frame-semantic equivalence class (Chen, 6 Jul 2025).

Several questions remain open. The paper points to possible extensions to other finitely transitive tense logics such as $L$54 and $L$55, where Kracht showed that there are infinitely many splittings (Chen, 6 Jul 2025). It also raises the possibility of anti-dichotomy phenomena analogous to those studied elsewhere for degrees of the finite model property in intuitionistic and transitive modal logics. More generally, it asks for a broader account of the relation among union-splittings, iterated splittings, and strictly Kripke-complete tense logics across wider classes of tense lattices (Chen, 6 Jul 2025).

Within the scope established so far, the theorem yields a precise and uniform picture. In the principal lattices of tense logic treated, semantic equivalence under Kripke frames is either trivial or continuum-sized, and the exact frontier between those two regimes is given by iterated splitting.