English
Related papers

Related papers: Modal reduction principles across relational seman…

200 papers

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…

The aim of the present paper is to generalise Sahlqvist correspondence theory to the many-valued modal semantics defined by Fitting, assuming a perfect Heyting algebra as truth value space. We present the standard translations between…

Logic · Mathematics 2025-06-12 Cecelia Britz , Willem Conradie , Wilmari Morton

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

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

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

Sabotage modal logic (SML) is a kind of dynamic logics. It extends static modal logic with a dynamic modality which is interpreted as "after deleting an arrow in the frame, the formula is true". In the present paper, we are aiming at…

Logic · Mathematics 2021-07-05 Zhiguang Zhao

Recent published work has addressed the Shalqvist correspondence problem for non-distributive logics. The natural question that arises is to identify the fragment of first-order logic that corresponds to logics without distribution, lifting…

Logic · Mathematics 2024-12-23 Chrysafis , Hartonas

We further develop the algebraic approach to input/output logic initiated in \cite{wollic22}, where subordination algebras and a family of their generalizations were proposed as a semantic environment of various input/output logics. In…

Logic in Computer Science · Computer Science 2024-12-03 Andrea De Domenico , Ali Farjami , Krishna Manoorkar , Alessandra Palmigiano , Mattia Panettiere , Xiaolong Wang

We extend unified correspondence theory to Kripke frames with impossible worlds and their associated regular modal logics. These are logics the modal connectives of which are not required to be normal: only the weaker properties of…

Logic · Mathematics 2016-05-27 Alessandra Palmigiano , Sumit Sourabh , Zhiguang Zhao

The relational version of the modal interpretation offers both a consistent quantum ontology and solution for quantum paradoxes within the framework of nonrelativistic quantum mechanics. In the present paper this approach is generalized for…

Quantum Physics · Physics 2007-05-23 Gyula Bene

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

In the present paper, we develop the algorithmic correspondence theory for hybrid logic with binder. We define the class of Sahlqvist inequalities, each inequality of which is shown to have a first-order frame correspondent effectively…

Logic in Computer Science · Computer Science 2021-07-13 Zhiguang Zhao

Given a class $\mathcal C$ of models, a binary relation ${\mathcal R}$ between models, and a model-theoretic language $L$, we consider the modal logic and the modal algebra of the theory of $\mathcal C$ in $L$ where the modal operator is…

Logic · Mathematics 2019-10-22 Denis I. Saveliev , Ilya B. Shapirovsky

The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap. These connections have been seminally observed and…

This paper is about Kripke structures that are inside a relational database and queried with a modal language. At first the modal language that is used is introduced, followed by a definition of the database and relational algebra. Based on…

Logic in Computer Science · Computer Science 2007-05-29 Yeb Havinga

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 primary goal of this paper is to recast the semantics of modal logic, and dynamic epistemic logic (DEL) in particular, in category-theoretic terms. We first review the category of relations and categories of Kripke frames, with…

Logic in Computer Science · Computer Science 2017-07-28 Kohei Kishida

This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…

Logic · Mathematics 2026-02-17 Ulf Hlobil

This paper involves generalizing the Goldblatt-Thomason and the Lindstr\"om characterization theorems to first-order modal logic.

Logic · Mathematics 2016-05-31 Reihane Zoghifard , Massoud Pourmahdian

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 ›