English
Related papers

Related papers: Explorations in Subexponential Non-associative Non…

200 papers

Several different proof translations exist between classical and intuitionistic logic (negative translations), and intuitionistic and linear logic (Girard translations). Our aims in this paper are (1) to consider extensions of…

Logic · Mathematics 2025-11-11 Gilda Ferreira , Paulo Oliva , Clarence Lewis Protin

We introduce coexponentials, a new set of modalities for Classical Linear Logic. As duals to exponentials, the coexponentials codify a distributed form of the structural rules of weakening and contraction. This makes them a suitable logical…

Logic in Computer Science · Computer Science 2021-03-05 Zesen Qian , G. A. Kavvos , Lars Birkedal

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

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

Interactive theorem provers based on dependent type theory have the flexibility to support both constructive and classical reasoning. Constructive reasoning is supported natively by dependent type theory and classical reasoning is typically…

Logic in Computer Science · Computer Science 2011-10-18 Russell O'Connor

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

Logic · Mathematics 2026-01-16 Georgi Nakov , Davide Emilio Quadrellaro

A noncommutative algebra corresponding to the classical catenoid is introduced together with a differential calculus of derivations. We prove that there exists a unique metric and torsion-free connection that is compatible with the complex…

Quantum Algebra · Mathematics 2018-02-14 Joakim Arnlind , Christoffer Holm

In this work we extend the recently introduced group-theoretical approach to moment-cumulant relations in non-commutative probability theory to the notion of conditionally free cumulants. This approach is based on a particular combinatorial…

Probability · Mathematics 2020-03-31 Kurusch Ebrahimi-Fard , Frederic Patras

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 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 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

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

We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…

Logic in Computer Science · Computer Science 2017-04-04 Andreas B. M. Brunner , Steffen Lewitzka

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…

Logic · Mathematics 2016-06-23 Nick Bezhanishvili , Nick Galatos , Luca Spada

The framework of quantitative equational logic has been successfully applied to reason about algebras whose carriers are metric spaces and operations are nonexpansive. We extend this framework in two orthogonal directions: algebras endowed…

Logic in Computer Science · Computer Science 2022-01-25 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

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

This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions. The idea in itself is…

Logic in Computer Science · Computer Science 2024-02-14 Beniamino Accattoli

The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…

Logic in Computer Science · Computer Science 2009-09-25 Marc Denecker

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

Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…

Logic in Computer Science · Computer Science 2022-01-03 Esaïe Bauer , Olivier Laurent
‹ Prev 1 3 4 5 6 7 10 Next ›