English
Related papers

Related papers: Modal Translation of Substructural Logics

200 papers

Logic is the science of correct inferences and a logical system is a tool to prove assertions in a certain logic in a correct way. There are many logical systems, and many ways of formalizing them, e.g., using natural deduction or sequent…

Logic in Computer Science · Computer Science 2013-01-22 Mário S. Alvim

Multiplicative linear logic is a very well studied formal system, and most such studies are concerned with the one-sided sequent calculus. In this paper we look in detail at existing translations between a deep inference system and the…

Logic · Mathematics 2024-04-03 Tomer Galor , Andrea Schalk

This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…

Logic in Computer Science · Computer Science 2026-05-19 Hirohiko Kushida

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Kozhemiachenko , Igor Sedlár

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

In 1988, Ivlev proposed four-valued non-deterministic semantics for modal logics in which the alethic T axiom holds good. Unfortunately, no completeness was proved. In previous work, we proved completeness for some Ivlev systems and…

Logic · Mathematics 2018-08-31 Marcelo E. Coniglio , Luis Fariñas del Cerro , Newton M. Peron

We investigate algebraic and topological semantics of the modal logic S4CI and obtain strong completeness of the given system in the case of local semantic consequence relations. In addition, we consider an extension of the logic S4CI with…

Logic · Mathematics 2024-06-04 Daniyar Shamkanov

This paper introduces a new family of cognitive modal logics designed to formalize conjectural reasoning: modal systems in which cognitive contexts extend known facts with hypothetical assumptions in order to explore their consequences.…

Logic in Computer Science · Computer Science 2026-03-24 Fabio Vitali

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

Logic in Computer Science · Computer Science 2016-09-15 Carlos Areces , Raul Fervari , Guillaume Hoffmann , Mauricio Martel

We introduce a new notion of structural refinement, a sound abstraction of logical implication, for the modal nu-calculus. Using new translations between the modal nu-calculus and disjunctive modal transition systems, we show that these two…

Logic in Computer Science · Computer Science 2014-06-11 Uli Fahrenberg , Axel Legay , Louis-Marie Traonouez

In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, exhibiting a classical…

Logic in Computer Science · Computer Science 2023-08-11 Eben Blaisdell , Max Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov

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

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, considering a classical…

Logic in Computer Science · Computer Science 2023-07-24 Eben Blaisdell , Max I. Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov

Kuroda's translation embeds first-order classical logic into intuitionistic logic, such that a formula and its translation are equivalent in classical logic. Recently, Brown and Rizkallah extended this translation to higher-order logic.…

Logic in Computer Science · Computer Science 2026-03-19 Thomas Traversié

Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of…

Logic in Computer Science · Computer Science 2015-04-20 Ranald Clouston , Rajeev Goré

We present a categorical theory of monads and distributive laws in substructural contexts. In the study of distributive laws, the roles of (the absence of) structural rules for variable contexts have been recognized; our theory formalizes…

Logic in Computer Science · Computer Science 2026-05-14 Soichiro Fujii , Yun Chen Tsai , Yoàv Montacute , Ichiro Hasuo

We briefly examine the modal formulae that can be derived in Multiplicative Additive Linear Logic (MALL) and some extensions by using Tarksi's extensional modal operators. We also breifly compare this with a substructural form of the modal…

Logic · Mathematics 2011-05-10 Robert Rothenberg

Several proof translations of classical mathematics into intuitionistic mathematics have been proposed in the literature over the past century. These are normally referred to as negative translations or double-negation translations. Among…

Logic in Computer Science · Computer Science 2011-01-31 Gilda Ferreira , Paulo Oliva

A topological space is \emph{hereditarily $k$-irresolvable} if none of its subspaces can be partitioned into $k$ dense subsets, We use this notion to provide a topological semantics for a sequence of modal logics whose $n$-th member…

Logic · Mathematics 2023-11-08 Robert Goldblatt