English
Related papers

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

200 papers

In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious…

Logic in Computer Science · Computer Science 2012-10-23 Roberto Maieli

We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…

Logic in Computer Science · Computer Science 2019-03-14 Christoph Benzmueller , Chad E. Brown , Michael Kohlhase

This paper considers two logics. The first one, $\mathbf{K}\mathsf{G}_\mathsf{inv}$, is an expansion of the G\"odel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim_\mathsf{i}$ defined as…

Logic · Mathematics 2024-01-30 Marta Bilkova , Thomas Ferguson , Daniil Kozhemiachenko

Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois connections using proof assistants remains limited to…

Programming Languages · Computer Science 2019-07-10 David Darais , David Van Horn

The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs. Graphical calculi for normal modal logics are developed…

Logic in Computer Science · Computer Science 2017-03-08 Minghui Ma , Ahti-Veikko Pietarinen

We introduce the notion of coherent graphs, and show how those can be used to define dynamic semantics for Multiplicative Linear Logic (MLL) extended with non-determinism. Thanks to the use of a coherence relation rather than mere formal…

Logic in Computer Science · Computer Science 2019-04-16 Lê Thành Dũng Nguyen , Thomas Seiller

Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…

Symbolic Computation · Computer Science 2025-04-15 Iago Leal de Freitas , Júlia Mota , João Paixão , Lucas Rufino

In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg's algebraic approach to characterization results in on judgment…

Logic in Computer Science · Computer Science 2016-03-29 Maria Esteban , Alessandra Palmigiano , Zhiguang Zhao

We give a novel approach to proving soundness and completeness for a logic (henceforth: the object-logic) that bypasses truth-in-a-model to work directly with validity. Instead of working with specific worlds in specific models, we reason…

Logic in Computer Science · Computer Science 2022-10-12 Alexander V. Gheorghiu , David J. Pym

This work concerns the proof theory of (left) skew monoidal categories and their variants (e.g. closed monoidal, symmetric monoidal), continuing the line of work initiated in recent years by Uustalu et al. Skew monoidal categories are a…

Logic in Computer Science · Computer Science 2024-04-24 Niccolò Veltri , Cheng-Syuan Wan

Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois connections remains limited to restricted modes of…

Programming Languages · Computer Science 2016-10-27 David Darais , David Van Horn

Statistical mechanics explains the properties of macroscopic phenomena based on the movements of microscopic particles such as atoms and molecules. Movements of microscopic particles can be represented by large-scale interacting systems. In…

Probability · Mathematics 2026-04-15 Kenichi Bannai , Jun Koriki , Makiko Sasada , Hidetada Wachi , Shuji Yamamoto

Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…

Logic in Computer Science · Computer Science 2023-05-01 Agata Ciabattoni , Timo Lang , Revantha Ramanayake

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 set up an algebraic theory of multivariable integration, based on a hierarchy of Rota-Baxter operators and an action of the matrix monoid as linear substitutions. Given a suitable coefficient domain with a bialgebra structure, this…

Rings and Algebras · Mathematics 2020-07-27 Markus Rosenkranz , Xing Gao , Li Guo

We note that the vanishing and injectivity theorems of Koll\'ar and Esnault-Viehweg can be used to give a quick algebraic proof of a strengthening of the Ein-Lazarsfeld Skoda-type division theorem for global sections of adjoint line bundles…

Algebraic Geometry · Mathematics 2008-08-18 Lawrence Ein , Mihnea Popa

We briefly examine the modal formulae that can be derived in Multiplicative Additive Linear Logic (MALL) and some extensions by using Tarksi's extensional modal operators. We also breifly compare this with a substructural form of the modal…

Logic · Mathematics 2011-05-10 Robert Rothenberg

We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…

Logic in Computer Science · Computer Science 2016-12-30 Eugenia Ternovska

We give a graphical calculus for a monoidal DG category $\cal{I}$ whose Grothendieck group is isomorphic to the ring $\mathbb{Z}[\sqrt{-1}]$. We construct a categorical action of $\cal{I}$ which lifts the action of $\mathbb{Z}[\sqrt{-1}]$…

K-Theory and Homology · Mathematics 2014-12-01 Yin Tian

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara