Related papers: Clones, closed categories, and combinatory logic
Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…
We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…
In this paper we provide a unifying description of different types of semantics of modal logic found in the literature via the framework of topological categories. In the style of categorical logic, we establish an exact correspondence…
We consider the canonical pseudodistributive law between various free limit completion pseudomonads and the free coproduct completion pseudomonad. When the class of limits includes pullbacks, we show that this consideration leads to notions…
We prove a class of equivalences of additive functor categories that are relevant to enumerative combinatorics, representation theory, and homotopy theory. Let $\mathscr{X}$ denote an additive category with finite direct sums and split…
We determine the combinatorics of transitive module categories over the monoidal category of finite dimensional $\mathfrak{sl}_3$-modules which arise when acting by the latter monoidal category on arbitrary simple $\mathfrak{sl}_3$-modules.…
Operational semantics have been enormously successful, in large part due to its flexibility and simplicity, but they are not compositional. Denotational semantics, on the other hand, are compositional but the lattice-theoretic models are…
In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the logic of inquisitive semantics, a semantic framework…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
A skeleton of the category with finite coproducts D freely generated by a single object has a subcategory isomorphic to a skeleton of the category with finite products C freely generated by a countable set of objects. As a consequence, we…
The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…
This paper presents an abstract, mathematical formulation of classical propositional logic. It proceeds layer by layer: (1) abstract, syntax-free propositions; (2) abstract, syntax-free contraction-weakening proofs; (3) distribution; (4)…
This tutorial gives an advanced introduction to string diagrams and graph languages for higher-order computation. The subject matter develops in a principled way, starting from the two dimensional syntax of key categorical concepts such as…
With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an…
We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…
We use the theory of Tambara modules to extend and generalize the reconstruction theorem for module categories over a rigid monoidal category to the non-rigid case. We show a biequivalence between the $2$-category of cyclic module…
This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…
Classical block designs are important combinatorial structures with a wide range of applications in Computer Science and Statistics. Here we give a new abstract description of block designs based on the arrow category construction. We show…
We prove 2-categorical conservativity for any {0,T}-free fragment of MALL over its corresponding intuitionistic version: that is, that the universal map from a closed symmetric monoidal category to the *-autonomous category that it freely…
This article serves as a preliminary introduction to the design of a new, open-source applied and computational category theory framework, named Categorica, built on top of the Wolfram Language. Categorica allows one to configure and…