English
Related papers

Related papers: A MALL Geometry of Interaction Based on Indexed Li…

200 papers

We use Lie-algebraic arguments to classify Lorentz-invariant theories of massless interacting scalars that feature coordinate-dependent redundant symmetries of the Galileon type. We show that such theories are determined, up to a set of…

High Energy Physics - Theory · Physics 2018-10-31 Mark P. Bogers , Tomas Brauner

It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type…

Computation and Language · Computer Science 2024-02-14 Sergey Slavnov

We derive an action describing edge dynamics on interfaces for gauge theories (Maxwell and Yang-Mills) using the path integral. The canonical structure of the edge theory is deduced and the thermal partition function calculated. We test the…

High Energy Physics - Theory · Physics 2018-12-05 Andreas Blommaert , Thomas G. Mertens , Henri Verschelde

In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of…

Logic in Computer Science · Computer Science 2025-07-23 Kostia Chardonnet , Alexis Saurin , Benoît Valiron

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

Monoidal closed categories naturally model NMILL, non-commutative multiplicative intuitionistic linear logic: the monoidal unit and tensor interpret the multiplicative verum and conjunction; the internal hom interprets linear implication.…

Logic in Computer Science · Computer Science 2022-04-15 Tarmo Uustalu , Niccolò Veltri , Cheng-Syuan Wan

We prove a completeness result for Multiplicative Exponential Linear Logic (MELL): we show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relational model is exactly axiomatized…

Logic in Computer Science · Computer Science 2016-05-12 Daniel de Carvalho

Imprimitivity theorems provide a fundamental tool for studying the representation theory and structure of crossed-product C*-algebras. In this work, we show that the Imprimitivity Theorem for induced algebras, Green's Imprimitivity Theorem…

Operator Algebras · Mathematics 2007-05-23 Siegfried Echterhoff , S. Kaliszewski , John Quigg , Iain Raeburn

Essentially generalizing Lie's results, we prove that the contact equivalence groupoid of a class of (1+1)-dimensional generalized nonlinear Klein-Gordon equations is the first-order prolongation of its point equivalence groupoid, and then…

Mathematical Physics · Physics 2021-06-22 Vyacheslav M. Boyko , Oleksandra V. Lokaziuk , Roman O. Popovych

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 present a new method of analysis of associative algebras. This method bears a certain resemblance to the famous analysis of commutative $C^*$-algebras in which an important role is played by multiplicative functionals over the algebra.…

Rings and Algebras · Mathematics 2007-05-23 Vladimir Dergachev

We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles) and the notion of negation is generalized to endomorphisms on this…

Logic · Mathematics 2017-03-21 Hongwei Xi , Hanwen Wu

Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…

Statistics Theory · Mathematics 2024-07-23 Qingyuan Zhao

We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…

Mathematical Physics · Physics 2012-04-11 Paolo Aluffi , Matilde Marcolli

We present the stellar resolution, a "flexible" tile system based on Robinson's first-order resolution. After establishing formal definitions and basic properties of the stellar resolution, we show its Turing-completeness and to illustrate…

Logic in Computer Science · Computer Science 2022-07-19 Boris Eng , Thomas Seiller

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

The two Girard translations provide two different means of obtaining embeddings of Intuitionistic Logic into Linear Logic, corresponding to different lambda-calculus calling mechanisms. The translations, mapping A -> B respectively to !A -o…

Logic in Computer Science · Computer Science 2025-01-29 Pablo Barenbaum , Eduardo Bonelli

A new calculus of planar diagrams involving diagrammatics for biadjoint functors and degenerate affine Hecke algebras is introduced. The calculus leads to an additive monoidal category whose Grothendieck ring contains an integral form of…

Representation Theory · Mathematics 2010-09-20 Mikhail Khovanov

We associate to every proof structure in multiplicative linear logic an ideal which represents the logical content of the proof as polynomial equations. We show how cut-elimination in multiplicative proof nets corresponds to instances of…

Logic · Mathematics 2022-07-25 Daniel Murfet , William Troiani

Formal theories of arithmetic have traditionally been based on either classical or intuitionistic logic, leading to the development of Peano and Heyting arithmetic, respectively. We propose to use $\mu$MALL as a formal theory of arithmetic…

Logic in Computer Science · Computer Science 2025-09-03 Matteo Manighetti , Dale Miller