English
Related papers

Related papers: Cofree coalgebras and differential linear logic

200 papers

The category of unital (unbounded) dg cocommutative coalgebras over a field of characteristic zero is provided with a structure of simplicial closed model category. This generalizes the model structure defined by Quillen in 1969 for…

Algebraic Geometry · Mathematics 2007-05-23 V. Hinich

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

Logic in Computer Science · Computer Science 2020-05-13 Vincenzo Ciancia , Diego Latella , Mieke Massink , Erik de Vink

We develop a categorical compositional distributional semantics for Lambek Calculus with a Relevant Modality, which has a limited version of the contraction and permutation rules. The categorical part of the semantics is a monoidal biclosed…

Logic in Computer Science · Computer Science 2021-01-27 Lachlan McPheat , Mehrnoosh Sadrzadeh , Hadi Wazni , Gijs Wijnholds

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

Cartesian differential categories come equipped with a differential combinator that formalizes the directional derivative from multivariable calculus. Cartesian differential categories provide a categorical semantics of the differential…

Logic in Computer Science · Computer Science 2022-11-04 Jean-Simon Pacaud Lemay

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

Combinatorics · Mathematics 2022-10-07 MLE Slone

We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…

Logic · Mathematics 2015-06-11 Matthew Harrison-Trainor , Alexander Melnikov , Antonio Montalbán

Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We…

Logic in Computer Science · Computer Science 2010-06-09 Benoît Valiron

A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…

q-alg · Mathematics 2009-10-30 Aristophanes Dimakis , J. Madore

We show that intuitionistic logic is deductively equivalent to Connexive Heyting Logic (CHL), hereby introduced as an example of a strong connexive logic with intuitive semantics. We use the reverse algebraisation paradigm: CHL is presented…

Logic · Mathematics 2022-09-01 Davide Fazio , Antonio Ledda , Francesco Paoli

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…

Logic in Computer Science · Computer Science 2014-01-08 Alejandro Díaz-Caro , Giulio Manzonetto , Michele Pagani

It is shown that propositional calculuses of both quantum and classical logics are non-categorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic…

Quantum Physics · Physics 2007-05-23 Mladen Pavicic , Norman D. Megill

Divergence-free Lie algebras (also known as the special Lie algebras of Cartan type) are Lie algebras of volume-preserving transformation groups. They are simple in generic case. Dokovic and Zhao found a certain graded generalization of…

Quantum Algebra · Mathematics 2010-12-17 Ling Chen

We study non-counital coalgebras and their dual non-unital algebras, and introduce the finite dual of a non-unital algebra. We show that a theory that parallels in good part the duality in the unital case can be constructed. Using this, we…

Representation Theory · Mathematics 2016-01-01 Sorin Dascalescu , Miodrag C. Iovanov

The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…

Logic in Computer Science · Computer Science 2012-03-06 Barbara Petit

We construct a diffeomorphism invariant (Colombeau-type) differential algebra canonically containing the space of distributions in the sense of L. Schwartz. Employing differential calculus in infinite dimensional (convenient) vector spaces,…

Functional Analysis · Mathematics 2007-05-23 Eva Farkas , Michael Grosser , Michael Kunzinger , Roland Steinbauer

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

Logic in Computer Science · Computer Science 2020-07-01 Nathanael Arkor , Marcelo Fiore

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

We present categories of open dynamical systems with general time evolution as categories of coalgebras opindexed by polynomial interfaces, and show how this extends the coalgebraic framework to capture common scientific applications such…

Category Theory · Mathematics 2023-08-01 Toby St. Clere Smithe
‹ Prev 1 3 4 5 6 7 10 Next ›