English
Related papers

Related papers: Explorations in Subexponential Non-associative Non…

200 papers

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

The use of exponentials in linear logic greatly enhances its expressive power. In this paper we focus on nonassociative noncommutative multiplicative linear logic, and systematically explore modal axioms K, T, and 4 as well as the…

Logic in Computer Science · Computer Science 2023-06-23 Eben Blaisdell

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…

Logic in Computer Science · Computer Science 2010-06-17 Kaustuv Chaudhuri

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

Linear logical frameworks with subexponentials have been used for the specification of among other systems, proof systems, concurrent programming languages and linear authorization logics. In these frameworks, subexponentials can be…

Logic · Mathematics 2019-10-09 Max Kanovich , Stepan Kuznetsov , Vivek Nigam , Andre Scedrov

Similar to modal connectives, the exponential ! in intuitionistic linear logic (ILL) is not canonical, in the sense that if $i\not= j$ then $!^i F\not\equiv !^j F$. Intuitively, this means that we can mark the exponential with labels taken…

Logic in Computer Science · Computer Science 2024-04-18 Carlos Olarte , Elaine Pimentel

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

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

Logic · Mathematics 2016-11-15 Giuseppe Greco , Alessandra Palmigiano

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

We introduce a non-associative and non-commutative version of propositional intuitionistic linear logic, called propositional non-associative non-commutative intuitionistic linear logic (NACILL for short). We prove that NACILL and any of…

Logic in Computer Science · Computer Science 2019-10-01 Hiromi Tanaka

This work contributes to the theory of judgment aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgment aggregation to cope with non-classical logics, we discuss in…

Logic in Computer Science · Computer Science 2017-11-13 Daniele Porello

On the one hand, classical logic is an extremely successful theory, even if not being perfect. On the other hand, intuitionistic logic is, without a doubt, one of the most important non-classical logics. But, how can proponents of one logic…

Logic in Computer Science · Computer Science 2022-04-15 Satoru Niki , Hitoshi Omori

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

Logic in Computer Science · Computer Science 2016-02-22 Kaustuv Chaudhuri

We prove that there are continuum-many axiomatic extensions of the full Lambek calculus with exchange that have the deductive interpolation property. Further, we extend this result to both classical and intuitionistic linear logic as well…

Logic · Mathematics 2023-08-04 Wesley Fussner , Simon Santschi

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should…

Logic in Computer Science · Computer Science 2019-04-16 Jiaming Jiang , Harley Eades , Valeria de Paiva

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

Logic · Mathematics 2009-09-29 Kai Bruennler

This paper establishes the normalisation of natural deduction or lambda calculus formulation of Intuitionistic Non Commutative Logic --- which involves both commutative and non commutative connectives. This calculus first introduced by de…

Logic in Computer Science · Computer Science 2014-02-04 Maxime Amblard , Christian Retoré

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

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…

We present a novel unity of logic, viz., a single sequent calculus that embodies classical, intuitionistic and linear logics. Concretely, we define classical linear logic negative (CLL$^-$), a new logic that is classical and linear yet…

Logic · Mathematics 2021-01-08 Norihiro Yamada
‹ Prev 1 2 3 10 Next ›