English
Related papers

Related papers: Non-Normal Super-Strict Implications

200 papers

In this paper, we consider the full Lambek calculus enriched with subexponential modalities in a distributive setting. We show that the distributive Lambek calculus with subexponentials is complete with respect to its Kripke frames via…

Logic in Computer Science · Computer Science 2023-08-10 Daniel Rogozin

In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…

Artificial Intelligence · Computer Science 2020-04-24 Laura Giordano , Valentina Gliozzi , Antonio Lieto , Nicola Olivetti , Gian Luca Pozzato

We show that the variety of modal lattices has the superamalgamation property. As a consequence, we obtain that the weak positive modal logic has the Craig interpolation property. Our proof employs the recent duality for modal lattices…

Logic · Mathematics 2026-03-17 Rodrigo Nicolau Almeida , Nick Bezhanishvili , Simon Lemal

We study the problem of finite entailment of ontology-mediated queries. Going beyond local queries, we allow transitive closure over roles. We focus on ontologies formulated in the description logics ALCOI and ALCOQ, extended with…

Artificial Intelligence · Computer Science 2020-07-01 Tomasz Gogacz , Víctor Gutiérrez-Basulto , Albert Gutowski , Yazmín Ibáñez-García , Filip Murlak

We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…

Logic in Computer Science · Computer Science 2026-05-06 Tim S. Lyon

This article aims to present a neighborhood semantic for a modal logic, namely, propositional logic of the plausible. As a subnormal character modal logic, not admits a Kripke semantics. However, the authors show that this neighborhood…

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…

Logic · Mathematics 2023-10-03 Sohei Iwata , Taishi Kurahashi , Yuya Okawa

This paper belongs to the field of probabilistic modal logic, focusing on a comparative analysis of two distinct semantics: one rooted in Kripke semantics and the other in neighbourhood semantics. The primary distinction lies in the…

Logic · Mathematics 2024-04-25 Nino Guallart

Faroldi argues that deontic modals are hyperintensional and thus traditional modal logic cannot provide an appropriate formalization of deontic situations. To overcome this issue, we introduce novel justification logics as hyperintensional…

Logic in Computer Science · Computer Science 2023-08-14 Atefeh Rohani , Thomas Studer

In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of…

Logic · Mathematics 2020-11-11 Ivano Ciardelli , Rosalie Iemhoff , Fan Yang

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…

Logic · Mathematics 2020-03-04 Hiromi Tanaka

This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility…

Logic · Mathematics 2024-10-29 Fatemeh Shirmohammadzadeh Maleki

We study the description logic SQ with number restrictions applicable to transitive roles, extended with either nominals or inverse roles. We show tight 2EXPTIME upper bounds for unrestricted entailment of regular path queries for both…

Logic in Computer Science · Computer Science 2020-10-23 Thomas Gogacz , Víctor Gutiérrez-Basulto , Yazmín Ibáñez-García , Jean Christoph Jung , Filip Murlak

We consider certain infectious logics (Sfde, dSfde, K3w, and PWK) and several their non-infectious modifications, including two new logics, reformulate previously constructed natural deduction systems for them (or present such systems from…

Logic in Computer Science · Computer Science 2022-04-15 Yaroslav Petrukhin

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler

We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…

Logic in Computer Science · Computer Science 2021-04-21 A. R. Balasubramanian , Timo Lang , Revantha Ramanayake

This Letter looks at the consequences of so-called 'superstrong nonlocal correlations', which are hypothetical violations of Bell/CHSH inequalities that are stronger than quantum mechanics allows, yet weak enough to prohibit…

Quantum Physics · Physics 2007-05-23 Wim van Dam

We present a novel investigation into the consistency operator ($\circ$), traditionally associated with paraconsistent logics, as a means of capturing non-normal modal classicalities within the Kripke framework. By semantically…

Logic · Mathematics 2026-02-25 Alfredo Roque Freire , Manuel António Martins

We introduce relational semantics for "flat Heyting-Lewis logic" $\mathsf{HLC}^{\flat}$. This logic arises as the extension of intuitionistic logic with a Lewis-style strict implication modality that, contrary to its "sharp" counterpart…

Logic · Mathematics 2026-03-31 Jim de Groot , Tadeusz Litak