English

Degree of Kripke-incompleteness of Tense Logics

Logic 2025-09-25 v2

Abstract

The degree of Kripke-incompleteness of a logic LL in some lattice L\mathcal{L} of logics is the cardinality of logics in L\mathcal{L} which share the same class of Kripke-frames with LL. A celebrated result on Kripke-incompleteness is Blok's dichotomy theorem for the degree of Kripke-incompleteness in NExt(K)\mathsf{NExt}(\mathsf{K}): every modal logic LNExt(K)L\in\mathsf{NExt}(\mathsf{K}) is of the degree of Kripke-incompleteness 11 or 202^{\aleph_0}. In this work, we show that the dichotomy theorem for NExt(K)\mathsf{NExt}(\mathsf{K}) can be generalized to the lattices \K\K, \LT\LT and \NExt(\ST)\NExt(\ST) of tense logics. We also prove that in \K\K, \LT\LT and \NExt(\ST)\NExt(\ST), iterated splittings are exactly the strictly Kripke-complete logics.

Keywords

Cite

@article{arxiv.2507.04533,
  title  = {Degree of Kripke-incompleteness of Tense Logics},
  author = {Qian Chen},
  journal= {arXiv preprint arXiv:2507.04533},
  year   = {2025}
}

Comments

22 pages, 3 figures