Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.10017

Compatibility between modal operators in distributive modal logic

Adam Přenosil
View original source ↗Read source document ↗Export metadata ↓

Abstract

Unlike in classical modal logic, in non-classical modal logics the box and diamond operators frequently fail to be interdefinable. Instead, these logics impose some compatibility conditions which tie the box and diamond operators together and ensure that in terms of Kripke semantics they arise from the same accessibility relation. This is, for instance, the case in the intuitionistic modal logic of Fischer Servi and the positive modal logic of Dunn. In these logics, however, such compatibility conditions also impose further conditions on the accessibility relation. In this paper, we identify the basic compatibility conditions which ensure that modal operators in distributive modal logics arise from a single accessibility relation without imposing any restrictions on the relation. As in the distributive logic of Gehrke, Nagahashi, and Venema, we allow for negative box and diamond operators here in addition to the usual positive ones. Intuitionistic modal logic and positive modal logic, or more precisely the corresponding classes of algebras, are then obtained in a modular way by adding certain canonical axioms which we call locality conditions on top of these basic compatibility conditions.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Adam Přenosil. 2023-11-16. Compatibility between modal operators in distributive modal logic. https://arxiv.org/abs/2311.10017

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗