English
Related papers

Related papers: Explorations in Subexponential non-associative non…

200 papers

This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved…

Logic in Computer Science · Computer Science 2007-05-23 Alessio Guglielmi

To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category Set, where coproducts are…

Logic in Computer Science · Computer Science 2015-07-01 Gianluigi Bellin

We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry-Howard correspondence for Classical Logic can be faithfully encoded. Our calculus enjoys confluence without…

Logic in Computer Science · Computer Science 2013-04-01 Alberto Carraro , Thomas Ehrhard , Antonino Salibra

In this work in progress, we discuss independence and interpolation and related topics for classical, modal, and non-monotonic logics.

Logic · Mathematics 2010-08-30 Dov Gabbay , Karl Schlechta

We extend some classical constructions in commutative algebra to the setting of modules over orders in (non-commutative) semisimple algebras. Our theory incorporates, inter alia, `reduced' versions of the notions of higher Fitting…

Number Theory · Mathematics 2025-09-16 David Burns , Takamichi Sano

Inquisitive modal logic, InqML, in its epistemic incarnation, extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. We use the natural notion of…

Logic · Mathematics 2025-02-13 Ivano Ciardelli , Martin Otto

We extend classical work by Janusz Czelakowski on the closure properties of the class of matrix models of entailment relations - nowadays more commonly called multiple-conclusion logics - to the setting of non-deterministic matrices…

Logic · Mathematics 2023-10-05 Carlos Caleiro , Sérgio Marcelino , Umberto Rivieccio

The multi-valued logic of {\L}ukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation, [DNE]. However, our…

Logic in Computer Science · Computer Science 2014-08-18 Rob Arthan , Paulo Oliva

The notion of linear exponential comonads on symmetric monoidal categories has been used for modelling the exponential modality of linear logic. In this paper we introduce linear exponential comonads on general (possibly non-symmetric)…

Logic in Computer Science · Computer Science 2017-01-25 Masahito Hasegawa

First-order multiplicative intuitionistic linear logic (MILL1) can be seen as an extension of the Lambek calculus. In addition to the fragment of MILL1 which corresponds to the Lambek calculus (of Moot & Piazza 2001), I will show fragments…

Computation and Language · Computer Science 2013-05-28 Richard Moot

In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…

Logic · Mathematics 2018-10-22 Sergio A. Celani , Ma. Paula Menchón

Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…

Logic · Mathematics 2016-08-09 Max Kanovich , Stepan Kuznetsov , Andre Scedrov

We establish the Lyndon interpolation property for basic lattice expansion logics (LE-logics) in arbitrary signatures using display calculi. Our approach is constructive, yielding interpolants algorithmically from derivations, and modular,…

We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…

Logic in Computer Science · Computer Science 2021-04-14 Guillaume Geoffroy

We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic equivalence relation on proofs induced by the multiset based…

Logic in Computer Science · Computer Science 2011-02-08 Daniel de Carvalho , Lorenzo Tortora de Falco

We describe a notion of categorical model for unitless fragments of (multiplicative) linear logic. The basic definition uses promonoidal categories, and we also give an equivalent elementary axiomatisation.

Category Theory · Mathematics 2013-05-13 Robin Houston , Dominic Hughes , Andrea Schalk

Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit…

Logic in Computer Science · Computer Science 2022-03-18 Dalia Papuc , Alban Ponse

Sequences of actions do not commute.. For example, the tick of a clock and the measurement of a position do not commute with one another, since the position will have moved to the next position after the tick. We adopt non-commutative…

Quantum Physics · Physics 2007-05-23 Louis H. Kauffman

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

Logic · Mathematics 2023-12-01 Nick Bezhanishvili , Anna Dmitrieva , Jim de Groot , Tommaso Moraschini

We present a translation from Multiplicative Exponential Linear Logic to a simply-typed lambda calculus with cyclic sharing. This translation is derived from a simple observation on the Int-construction on traced monoidal categories. It…

Logic in Computer Science · Computer Science 2019-04-16 Masahito Hasegawa