English
Related papers

Related papers: Logic and linear algebra: an introduction

200 papers

Three categories of algebras with morphisms generalising the usual set of algebra homomorphisms are described. The Sweedler product provides a hom-tensor equivalence relating these three categories, and a tool enabling the universal…

Rings and Algebras · Mathematics 2021-05-07 Marjorie Batchelor , Will Boulton , Daren Chen , Jonathan Rawlinson , Mustafa Warsi

In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…

Logic in Computer Science · Computer Science 2024-01-29 Thomas Ehrhard

In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative, Particular Affirmative and Particular Negative. Possible relations between two of the mentioned type of propositions are encoded in…

Quantum Physics · Physics 2014-04-24 Hector Freytes , Christian de Ronde , Graciela Domenech

We describe free rigid commutative algebras in $2$-presentably symmetric monoidal $(\infty,2)$-categories as oplax colimits over the $1$-dimensional framed cobordism category. The special case of the $(\infty,2)$-category…

Category Theory · Mathematics 2026-04-03 Maxime Ramzi

We present an unified construction for algebras and modules homologies and cohomologies, in the case of associative, commuttaive, Lie and Gerstenhaber algebras. We make a distinction between the linear part of the construction of algebras…

Quantum Algebra · Mathematics 2008-08-27 Ridha Chatbouri

Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…

Logic in Computer Science · Computer Science 2015-03-17 Christoph Benzmueller

We introduce rigid algebras, a generalization of rigid categories to arbitrary symmetric monoidal $(\infty,2)$-categories. We develop their general theory, showing in particular that the a priori $(\infty,2)$-category of rigid algebras is…

Category Theory · Mathematics 2026-05-25 Leor Neuhauser

The Lie algebra of planar vector fields with coefficients from the field of rational functions over an algebraically closed field of characteristic zero is considered. We find all finite-dimensional Lie algebras that can be realized as…

Rings and Algebras · Mathematics 2013-01-10 Ievgen Makedonskyi , Anatoliy Petravchuk

On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…

Classical Analysis and ODEs · Mathematics 2007-05-23 Stephen Semmes

In this note, we observe a relation between dialgebras (in particular, Leibniz algebras) and conformal algebras. The purpose is to show how the methods of conformal algebras help solving problems on dialgebras, and, conversely, how the…

Quantum Algebra · Mathematics 2015-09-17 Pavel Kolesnikov

This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and…

Logic · Mathematics 2023-06-22 Alex Kruckman , Lawrence S. Moss

Recent work on loglinear models in probabilistic constraint logic programming is applied to first-order probabilistic reasoning. Probabilities are defined directly on the proofs of atomic formulae, and by marginalisation on the atomic…

Artificial Intelligence · Computer Science 2013-01-30 James Cussens

We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…

Artificial Intelligence · Computer Science 2009-05-18 Christoph Benzmueller , Lawrence C. Paulson

The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semantic interpretations can be expressed directly in a fragment of linear logic in a way that explains correctly the…

cmp-lg · Computer Science 2008-02-03 Mary Dalrymple , John Lamping , Fernando Pereira , Vijay Saraswat

This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional and extensional calculi can be related in logical systems. We…

Category Theory · Mathematics 2014-10-17 Michal R. Przybylek

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

These expanded lecture notes are based on a tutorial on categorical proof theory presented at the summer school associated with the conference "Topology, Algebra, and Categories in Logic 2021-2022." The chapter delves into various…

Logic · Mathematics 2025-03-25 Amirhossein Akbar Tabatabai

We present a proof system for a multimodal logic, based on our previous work on a multimodal Martin-Loef type theory. The specification of modes, modalities, and implications between them is given as a mode theory, i.e. a small 2-category.…

Logic in Computer Science · Computer Science 2023-05-22 G. A. Kavvos , Daniel Gratzer

Relational semantics for linear logic is a form of non-idempotent intersection type system, from which several informations on the execution of a proof-structure can be recovered. An element of the relational interpretation of a…

Logic in Computer Science · Computer Science 2016-06-02 Giulio Guerrieri , Luc Pellissier , Lorenzo Tortora de Falco

We present a first-order linear-time temporal logic for reasoning about the evolution of directed graphs. Its semantics is based on the counterpart paradigm, thus allowing our logic to represent the creation, duplication, merging, and…

Logic in Computer Science · Computer Science 2023-05-09 Fabio Gadducci , Andrea Laretto , Davide Trotta