English
Related papers

Related papers: Sahlqvist theory for impossible worlds

200 papers

We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattices with operators'. Specifically, we introduce a very…

Logic · Mathematics 2016-04-05 Willem Conradie , Alessandra Palmigiano

In recent years, unified correspondence has been developed as a generalized Sahlqvist theory which applies uniformly to all signatures of normal and regular (distributive) lattice expansions. This includes a general definition of the…

Logic · Mathematics 2023-06-22 Willem Conradie , Alessandra Palmigiano , Zhiguang Zhao

The present paper proposes a new introductory treatment of the very well known Sahlqvist correspondence theory for classical modal logic. The first motivation for the present treatment is {\em pedagogical}: classical Sahlqvist…

Logic · Mathematics 2016-06-23 Willem Conradie , Alessandra Palmigiano , Sumit Sourabh

The present paper develops a unified correspondence treatment of the Sahlqvist theory for possibility semantics, extending the results in \cite{Ya16} from Sahlqvist formulas to the strictly larger class of inductive formulas, and from the…

Logic · Mathematics 2016-12-16 Zhiguang Zhao

We prove the canonicity of inductive inequalities in a constructive meta-theory, for classes of logics algebraically captured by varieties of normal and regular lattice expansions. This result encompasses Ghilardi-Meloni's and Suzuki's…

Logic · Mathematics 2023-06-22 Willem Conradie , Alessandra Palmigiano

We present an extension and generalization of Sahlqvist--Van Benthem correspondence to the case of distribution-free modal logic, with, or without negation and/or implication connectives. We follow a reductionist strategy, reducing the…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis , Hartonas

Modal logic with propositional quantifiers (i.e. second-order propositional modal logic (SOPML)) has been considered since the early time of modal logic. Its expressive power and complexity are high, and its van-Benthem-Rosen theorem and…

Logic in Computer Science · Computer Science 2021-10-19 Zhiguang Zhao

We study the completeness problem for propositionally quantified modal logics on quantifiable general frames, where the admissible sets are the propositions the quantifiers can range over and expressible sets of worlds are admissible, and…

Logic · Mathematics 2024-06-25 Yifeng Ding , Yipu Li

We generalize Venema's result on the canonicity of the additivity of positive terms, from classical modal logic to a vast class of logics the algebraic semantics of which is given by varieties of normal distributive lattice expansions…

Logic in Computer Science · Computer Science 2016-12-20 Willem Conradie , Alessandra Palmigiano , Sumit Sourabh , Zhiguang Zhao

In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form $\forall x_0 \exists x_1 \dots \exists x_n \bigwedge x_i R_\lambda x_j$. We prove that many properties of these logics, such…

Logic · Mathematics 2015-03-02 Stanislav Kikot

The present paper establishes systematic connections among the first-order correspondents of Sahlqvist modal reduction principles in various relational semantic settings which include crisp and many-valued Kripke frames, and crisp and…

The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

The language of modal logic is capable of expressing first-order conditions on Kripke frames. The classic result by Henrik Sahlqvist identifies a significant class of modal formulas for which first-order conditions -- or Sahlqvist…

Logic in Computer Science · Computer Science 2022-06-14 Rui Li , Francesco Belardinelli

We study model and frame definability of various modal logics. Let ML(A+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models…

Logic · Mathematics 2018-12-17 Katsuhiko Sano , Jonni Virtema

We say that a Kripke model is a GL-model if the accessibility relation $\prec$ is transitive and converse well-founded. We say that a Kripke model is a D-model if it is obtained by attaching infinitely many worlds $t_1, t_2, \ldots$, and…

Logic · Mathematics 2025-08-13 Ryo Kashima , Taishi Kurahashi , Sohei Iwata , So Morioka

Graph-based frames have been introduced as a logical framework which internalizes an inherent boundary to knowability. They also support the interpretation of lattice-based (modal) logics as hyper-constructive logics of evidential…

In this paper, we study logics of bounded distributive residuated lattices with modal operators considering $\Box$ and $\Diamond$ in a noncommutative setting. We introduce relational semantics for such substructural modal logics. We prove…

Logic · Mathematics 2020-06-02 Daniel Rogozin

By exploiting the algebraic and order theoretic mechanisms behind Sahlqvist correspondence, the theory of unified correspondence provides powerful tools for correspondence and canonicity across different semantics and signatures, covering…

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for both logical and computational reasons. On the other hand,…

Logic in Computer Science · Computer Science 2017-01-11 Willem Conradie , Valentin Goranko , Dimiter Vakarelov
‹ Prev 1 2 3 10 Next ›