English
Related papers

Related papers: Collapsing Constructive and Intuitionistic Modal L…

200 papers

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

We obtain poly-time embeddings of the intuitionistic modal logics FS and MIPC into their positive one-variable fragments.

Logic · Mathematics 2023-06-28 M. Rybakov , D. Shkatov

We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal…

Computational Complexity · Computer Science 2015-07-01 Martin Mundhenk , Felix Weiss

Intuitionistic conditional logic, studied by Weiss, Ciardelli and Liu, and Olkhovikov, aims at providing a constructive analysis of conditional reasoning. In this framework, the would and the might conditional operators are no longer…

Logic in Computer Science · Computer Science 2025-07-04 Tiziano Dalmonte , Marianna Girlando

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

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…

Logic · Mathematics 2022-10-06 Zhiguang Zhao

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…

Logic · Mathematics 2016-06-23 Nick Bezhanishvili , Nick Galatos , Luca Spada

Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form $p\wedge\Diamond\neg p$ ('$p$, but it might be that not $p$') appears to be a…

Logic in Computer Science · Computer Science 2024-03-26 Wesley H. Holliday , Matthew Mandelkern

In this note, we prove that intuitionistic modal logic LIK4 is decidable.

Logic in Computer Science · Computer Science 2025-12-05 Philippe Balbiani , Çigdem Gencer , Tinko Tinchev

Following A. Kuznetsov's outline, we restore Kuznetsov's syntactic proof of the assertoric equipollence of the intuitionistic propositional calculus and the proof-intuitionistic calculus KM (Kuznetsov's Theorem). Then, we show that this…

Logic · Mathematics 2017-08-24 Alexei Muravitsky

In this chapter we study modal logics of topological spaces in the combined language with the derivational modality and the difference modality. We give axiomatizations and prove completeness for the following classes: all spaces,…

Logic · Mathematics 2014-05-27 Andrey Kudinov , Valentin Shehtman

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the…

Logic in Computer Science · Computer Science 2023-06-22 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

Within the possibilistic approach to uncertainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We relate this qualitative…

Logic in Computer Science · Computer Science 2013-02-28 Petr Hajek , Dagmar Harmancová , Francesc Esteva , Pere Garcia , Lluis Godo

Modal logic is a paradigm for several useful and applicable formal systems in computer science. It generally retains the low complexity of classical propositional logic, but notable exceptions exist in the domains of description, temporal,…

Logic in Computer Science · Computer Science 2016-09-15 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco

This paper considers two logics. The first one, $\mathbf{K}\mathsf{G}_\mathsf{inv}$, is an expansion of the G\"odel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim_\mathsf{i}$ defined as…

Logic · Mathematics 2024-01-30 Marta Bilkova , Thomas Ferguson , Daniil Kozhemiachenko

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

We give a new coalgebraic semantics for intuitionistic modal logic with $\Box$. In particular, we provide a colagebraic representation of intuitionistic descriptive modal frames and of intuitonistic modal Kripke frames based on image-finite…

Logic · Mathematics 2024-06-18 Rodrigo Nicolau Almeida , Nick Bezhanishvili