In [12] the study of Positive Modal Logic is initiated using standard Kripke semantics and the positive modal algebras are introduced. The minimum system of Positive Modal Logic is the -fragment of the local consequence relation defined by the class of all Kripke models. It can be axiomatized by a sequent calculus and extensions of it can be obtained by adding sequents as new axioms. In [6] a new semantics for PML is proposed to overcome some frame incompleteness problems discussed (...) in [12]. The frames of this semantics consists of a set of indexes, a quasi-order on them and an accessibility relation. The models are obtained by using increasing valuations relatively to the quasi-order of the frame. This semantics is coherent with the dual structures obtained by developing the Priestley duality for positive modal algebras, one of the topics or the present paper, and can be seen also as arising from the Kripke semantics for a suitable intuitionistic modal logic. The present paper is devoted to the study of the mentioned duality as well as to proving some d-persistency results as well as a Sahlqist Theorem for sequents and the semantics proposed in [6]. Also a Goldblatt-Thomason theorem that characterizes the elementary classes of frames of that semantics that are definable by sets of sequents is proved. (shrink)

In this paper we study the expressive power and definability for modal languages interpreted on topological spaces. We provide topological analogues of the van Benthem characterization theorem and the Goldblatt–Thomason definability theorem in terms of the well-established first-order topological language.

This paper deals with two main topics: One is a semantical investigation for a bimodal language with a modal operator \blacksquare associated with the intersection of the accessibility relation R and the inequality ≠. The other is a generalization of some of the former results to general extended languages with modal operators. First, for our language L\sb{\square\blacksquare}, we prove that Segerberg's theorem (equivalence between finite frame property and finite model property) fails and establish both van Benthem-style and Goldblatt-Thomason-style characterizations. We (...) extract the notion of \blacksquare-realizer (a generalization of bulldozing) as an essence from the proofs of our results. Second, we generalize the notion of \blacksquare-realizer and prove quite general versions of these semantical characterization results. The known and previously unknown characterization results for almost all of the languages extended with modal operators already proposed will be immediate corollaries. (shrink)

Several extensions of the basic modal language are characterized in terms of interpolation. Our main results are of the following form: Language ℒ' is the least expressive extension of ℒ with interpolation. For instance, let ℳ be the extension of the basic modal language with a difference operator [7]. First-order logic is the least expressive extension of ℳ with interpolation. These characterizations are subsequently used to derive new results about hybrid logic, relation algebra and the guarded fragment.