Related papers: Cofree coalgebras and differential linear logic
We define a functor from the category of Lie conformal algebras to the category of differential Lie coalgebras, which associates to any Lie conformal algebra $L$ a differential Lie coalgebra $L^{\,0}$, defined as the maximal good…
We study counting propositional logic as an extension of propositional logic with counting quantifiers. We prove that the complexity of the underlying decision problem perfectly matches the appropriate level of Wagner's counting hierarchy,…
We present new descriptive complexity characterisations of classes REG (regular languages), LCFL (linear context-free languages) and CFL (context-free languages) as restrictions on inference rules, size of formulae and permitted connectives…
In this paper, I establish the categorical structure necessary to interpret dependent inductive and coinductive types. It is well-known that dependent type theories \`a la Martin-L\"of can be interpreted using fibrations. Modern theorem…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
We prove that the simplicial cocommutative coalgebra of singular chains on a connected topological space determines the homotopy type rationally and one prime at a time, without imposing any restriction on the fundamental group. In…
The notion of vertex operator coalgebra is presented and motivated via the geometry of conformal field theory. Specifically, we describe the category of geometric vertex operator coalgebras, whose objects have comultiplicative structures…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical propositional logic. In this work, we extend lambda-PRK to…
We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The…
We classify Lie 3-algebras possessing an invariant lorentzian inner product. The indecomposable objects are in one-to-one correspondence with compact real forms of metric semisimple Lie algebras. We analyse the moduli space of classical…
This short note presents a new formal language, lambda dependency-based compositional semantics (lambda DCS) for representing logical forms in semantic parsing. By eliminating variables and making existential quantification implicit, lambda…
As a practical foundation for a homotopy theory of abstract spacetime, we extend a category of certain compact partially ordered spaces to a convenient category of locally preordered spaces. In particular, we show that our new category is…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic)…
We define a class of quadratic differential algebras which are generated as differential graded algebras by the elements of an Euclidean space. Such a differential algebra is a differential calculus over the quadratic algebra of its…
Free and cofree equivariant spectra are important classes of equivariant spectra which represent equivariant cohomology theories on free equivariant spaces. Greenlees-Shipley and Pol and the author have given an algebraic model for rational…
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original…
We study the connection between two combinatorial notions associated to a quiver: the quiver algebra and the path coalgebra. We show that the quiver coalgebra can be recovered from the quiver algebra as a certain type of finite dual, and we…