Finite Kripke Research Articles

Cut-free sequent calculi for logics characterized by finite linear Kripke frames

Cut-free sequent calculi for logics characterized by finite linear Kripke frames

Characterizations of Negative Definability in Modal Logic

Negative definability ([18]) is an alternative way of defining classes of Kripke frames via a modal language, one that enables us, for instance, to define the class of irreflexive frames. Besides a list of closure conditions for negatively definable classes, the paper contains two main theorems. First, a characterization is given of negatively definable classes of (rooted) finite transitive Kripke frames and of such classes defined using both traditional (positive) and negative definitions. Second, we characterize the negatively definable classes of rooted general frames.

Semantic trees for Dummett's logic LC

The aim of this paper is to provide a decision procedure for Dummett's logic LC, such that with any given formula will be associated either a proof in a sequent calculus equivalent to LC or a finite linear Kripke countermodel.