Degree of Kripke-incompleteness of Tense Logics
Abstract
The degree of Kripke-incompleteness of a logic L in some lattice L of logics is the cardinality of logics in L which share the same class of Kripke-frames with L. A celebrated result on Kripke-incompleteness is Blok's dichotomy theorem for the degree of Kripke-incompleteness in NExt(K): every modal logic L∈NExt(K) is of the degree of Kripke-incompleteness 1 or 20. In this work, we show that the dichotomy theorem for NExt(K) can be generalized to the lattices , and () of tense logics. We also prove that in , and (), iterated splittings are exactly the strictly Kripke-complete logics.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.