SearcharxivSearch

arXiv · 2510.17302

On the Contingency of Logic in Possible World Semantics

Abstract

This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds. Standard Kripkean semantics assumes that all possible worlds are governed by one single logic. We relax this assumption and introduce mixed models, in which different worlds may obey different logical systems. The paper provides a first case study where we mix classical propositional logic ($\mathsf{CPC}$) and intuitionistic propositional logic ($\mathsf{IPC}$) in the possible world semantics. We define the class of mixed models $\mathcal{M}\mathcal{M}(\mathsf{CPC}, \mathsf{IPC})$, together with a subclass of concrete mixed models ($\mathcal{CMM}$), and establish their semantic properties. Our main result shows that the set of formulas valid in $\mathcal{M}\mathcal{M}(\mathsf{CPC}, \mathsf{IPC})$ corresponds exactly to the intuitionistic modal logic $\mathsf{iK}$ extended with the Box Excluded Middle axiom ($\mathsf{iK} + \mathsf{bem}$). To demonstrate this, we prove soundness and completeness results linking $\mathcal{M}\mathcal{M}(\mathsf{CPC}, \mathsf{IPC})$ and $\mathcal{CMM}$, and birelational models for $\mathsf{iK} + \mathsf{bem}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Iris van der Giessen, Joost J. Joosten, Paul Mayaux, Vicent Navarro Arroyo. 2025-10-20. On the Contingency of Logic in Possible World Semantics. https://arxiv.org/abs/2510.17302

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

KEEP EXPLORING

Related papers

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

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

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