Related papers: Cofree coalgebras and differential linear logic

We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation. One feature of this lambda…

A method of classification of integrable equations on quad-graphs is discussed based on algebraic ideas. We assign a Lie ring to the equation and study the function describing the dimensions of linear spaces spanned by multiple commutators…

We construct the analogue of Takeuchi's free Hopf algebra in the setting of Poisson Hopf algebras. More precisely, we prove that there exists a free Poisson Hopf algebra on any coalgebra or, equivalently that the forgetful functor from the…

We consider the cotriple resolution of algebras over operads in differential graded modules. We focus, to be more precise, on the example of algebras over the differential graded Barratt-Eccles operad and on the example of commutative…

Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…

We introduce a new invariant, the real (logarithmic)-Kodaira dimension, that allows to distinguish smooth real algebraic surfaces up to birational diffeomorphism. As an application, we construct infinite families of smooth rational real…

Derivations provide a way of transporting ideas from the calculus of manifolds to algebraic settings where there is no sensible notion of limit. In this paper, we consider derivations in certain monoidal categories, called codifferential…

We show that, for a principal ideal domain R, the homotopy category of Bousfield R-local spaces injects fully faithful into a homotopy category of simplicial pointed flat coalgebras.

The differentiable implementation of logic yields a seamless combination of symbolic reasoning and deep neural networks. Recent research, which has developed a differentiable framework to learn logic programs from examples, can even acquire…

We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic). This graphical calculus of proofs inherits good features from…

In this note, we show that the category of strongly central series admits co-induced actions, which means that it is Locally Algebraically Cartesian Closed. We also show that some co-induction functors exist in the category of topological…

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…

This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…

Every endofunctor of the category of classes is proved to be set-based in the sense of Aczel and Mendler, therefore, it has a final coalgebra. Other basic properties of these endofunctors are proved, e.g. the existence of a free completely…

We give a mathematical framework to describe the evolution of an open quantum systems subjected to finitely many interactions with classical apparatuses. The systems in question may be composed of distinct, spatially separated subsystems…

We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…

Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal…

We present an integer programming framework to build accurate and interpretable discrete linear classification models. Unlike existing approaches, our framework is designed to provide practitioners with the control and flexibility they need…

Based on an original classification of differential equations by types of regular Lie group actions, we offer a systematic procedure for describing partial differential equations with prescribed symmetry groups. Using a new powerful…