Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2210.02216

Correspondence Theory for Modal Fairtlough-Mendler Semantics of Intuitionistic Modal Logic

Zhiguang Zhao
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the correspondence theory of intuitionistic modal logic in modal Fairtlough-Mendler semantics (modal FM semantics) \cite{FaMe97}, which is the intuitionistic modal version of possibility semantics \cite{Ho16}. We identify the fragment of inductive formulas \cite{GorankoV06} in this language and give the algorithm $\mathsf{ALBA}$ \cite{CoPa12} in this semantic setting. There are two major features in the paper: one is that in the expanded modal language, the nominal variables, which are interpreted as atoms in perfect Boolean algebras, complete join-prime elements in perfect distributive lattices and complete join-irreducible elements in perfect lattices, are interpreted as the refined regular open closures of singletons in the present setting, similar to the possibility semantics for classical normal modal logic \cite{Zh21d}; the other feature is that we do not use conominals or diamond, which restricts the fragment of inductive formulas significantly. We prove the soundness of the $\mathsf{ALBA}$ with respect to modal FM frames and show that the $\mathsf{ALBA}$ succeeds on inductive formulas, similar to existing settings like \cite{CoPa12,Zh21d,Zh22a}.

Explore related subjects

math.LOcs.LO

Keep this discovery

BibTeXRIS

Zhiguang Zhao. 2022-10-05. Correspondence Theory for Modal Fairtlough-Mendler Semantics of Intuitionistic Modal Logic. https://arxiv.org/abs/2210.02216

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↗