English
Related papers

Related papers: Collapsing Constructive and Intuitionistic Modal L…

200 papers

The intuitionistic modal logics considered between Constructive K (CK) and Intuitionistic K (IK) differ in their treatment of the possibility (diamond) connective. It was recently rediscovered that some logics between CK and IK also…

Logic in Computer Science · Computer Science 2025-04-23 Jim de Groot , Ian Shillito , Ranald Clouston

Justification logics are an explication of modal logic; boxes are replaced with proof terms formally through realisation theorems. This can be achieved syntactically using a cut-free proof system e.g. using sequent, hypersequent or nested…

Logic in Computer Science · Computer Science 2025-07-15 Sonia Marin , Paaras Padhiar

Uniform interpolation is a strong form of interpolation providing an interpretation of propositional quantifiers within a propositional logic. Pitts' seminal work establishes this property for intuitionistic propositional logic relying on a…

Logic in Computer Science · Computer Science 2026-05-28 Iris van der Giessen , Ian Shillito

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

We investigate intuitionistic modal logics with locally interpreted $\square$ and $\lozenge$. The basic logic LIK is stronger than constructive modal logic WK and incomparable with intuitionistic modal logic IK. We propose an axiomatization…

Logic in Computer Science · Computer Science 2024-03-12 Philippe Balbiani , Han Gao , Çiğdem Gencer , Nicola Olivetti

We carry out a semantic study of the constructive modal logic CK. We provide a categorical duality linking the algebraic and birelational semantics of the logic. We then use this to prove Sahlqvist style correspondence and completeness…

Logic · Mathematics 2026-04-14 Jim de Groot , Ian Shillito , Ranald Clouston

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…

Logic · Mathematics 2023-11-17 Adam Přenosil

In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.

Logic in Computer Science · Computer Science 2025-03-25 Philippe Balbiani , Cigdem Gencer

We develop polytopological semantics for various constructive, intuitionistic, and G\"odel--Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over…

Logic · Mathematics 2026-04-28 Juan P. Aguilera , David Fernández-Duque , Leonardo Pacheco

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

Logic · Mathematics 2024-11-26 Safal Raman Aryal

We introduce a basic intuitionistic conditional logic $\mathsf{IntCK}$ that we show to be complete both relative to a special type of Kripke models and relative to a standard translation into first-order intuitionistic logic. We show that…

Logic · Mathematics 2023-06-21 Grigory Olkhovikov

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

Intuitionistic modal logics (IMLs) extend intuitionistic propositional logic with modalities such as the box and diamond connectives. Advances in the study of IMLs have inspired several applications in programming languages via the…

Logic in Computer Science · Computer Science 2025-12-12 Nachiappan Valliappan

We investigate the complexity of modal satisfiability for certain combinations of modal logics. In particular we examine four examples of multimodal logics with dependencies and demonstrate that even if we restrict our inputs to…

Logic in Computer Science · Computer Science 2015-11-17 Antonis Achilleos

In this paper we provide two new semantics for proofs in the constructive modal logics CK and CD. The first semantics is given by extending the syntax of combinatorial proofs for propositional intuitionistic logic, in which proofs are…

Logic in Computer Science · Computer Science 2021-04-20 Matteo Acclavio , Davide Catta , Lutz Straßburger

We introduce the semantically-defined constructive master-modality logics $\sf CK^*$ and $\sf WK^*$, extending the basic constructive modal logic $\sf CK$ and the Wijesekera-style logic $\sf WK$ obtained by impossing infallibility. Using…

Logic in Computer Science · Computer Science 2026-03-06 Sofía Santiago-Fernández , David Fernández-Duque , Joost J. Joosten

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in…

Logic in Computer Science · Computer Science 2025-08-13 Tiziano Dalmonte

Classical logic (the logic of non-constructive mathematics) is stronger than intuitionistic logic (the logic of constructive mathematics). Despite this, there are copies of classical logic in intuitionistic logic. All copies usually found…

Logic · Mathematics 2012-11-09 Jaime Gaspar

In this article, we add a diamond to the parametrized box-based propositional language of intuitionistic doxastic logic and intuitionistic epistemic logic introduced by Artemov and Protopopescu. The main results of this article are the…

Logic in Computer Science · Computer Science 2025-09-17 Philippe Balbiani

We present constructive provability logic, an intuitionstic modal logic that validates the L\"ob rule of G\"odel and L\"ob's provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and…

Logic in Computer Science · Computer Science 2012-05-30 Robert J. Simmons , Bernardo Toninho
‹ Prev 1 2 3 10 Next ›