Related papers: Doctrines, modalities and comonads
Internal categories feature notions of limit and completeness, as originally proposed in the context of the effective topos. This paper sets out the theory of internal completeness in a general context, spelling out the details of the…
We give a brief account of the modal logic of the generic multiverse, which is a bimodal logic with operators corresponding to the relations "is a forcing extension of" and "is a ground model of". The fragment of the first relation is…
We describe a novel classifier with a tree structure, designed using information theory concepts. This Information Network is made of information nodes, that compress the input data, and multiplexers, that connect two or more input nodes to…
In this paper, we deal with the problem of putting together modal worlds that operate in different logic systems. When evaluating a modal sentence $\Box \varphi$, we argue that it is not sufficient to inspect the truth of $\varphi$ in…
In this short note, we classify linear categorified open topological field theories in dimension two by pivotal Grothendieck-Verdier categories, a type of monoidal category equipped with a weak, not necessarily rigid duality. In combination…
Recent studies have revealed that neural networks learn interpretable algorithms for many simple problems. However, little is known about how these algorithms emerge during training. In this article, I study the training dynamics of a small…
We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…
The purpose of this paper is to study the derived category of simplicial multicategories with arbitrary sets of objects (also known as, colored operads in simplicial sets). Our main result is a derived Morita theory for operads-where we…
Generalizing the algebraic formulation of the First Fundamental Theorem of Calculus (FFTC), a class of constraints involving a pair of operators was considered in \cite{ZGK2}. For a given constraint, the existences of extensions of…
Deep neural networks have achieved remarkable success, yet our understanding of how they learn remains limited. These models can learn high-dimensional tasks, which is generally statistically intractable due to the curse of dimensionality.…
Cartesian differential categories come equipped with a differential combinator that formalizes the derivative from multi-variable differential calculus, and also provide the categorical semantics of the differential $\lambda$-calculus. An…
Algebraic structures such as monoids, groups, and categories can be formulated within a category using commutative diagrams. In many common categories these reduce to familiar cases. In particular, group objects in Grp are abelian groups,…
Probabilistic sentential decision diagrams are a class of structured-decomposable probabilistic circuits especially designed to embed logical constraints. To adapt the classical LearnSPN scheme to learn the structure of these models, we…
Lenses are a well-established structure for modelling bidirectional transformations, such as the interactions between a database and a view of it. Lenses may be symmetric or asymmetric, and may be composed, forming the morphisms of a…
This note is a survey on the basic aspects of moduli theory along with some examples. In that respect, one of the purposes of this current document is to understand how the introduction of stacks circumvents the non-representability problem…
We have previously introduced role logic as a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of role logic corresponds to two-variable logic with counting and…
We give an alternate conception of string diagrams as labeled 1-dimensional oriented cobordisms, the operad of which we denote by Cob/O, where O is the set of string labels. The axioms of traced (symmetric monoidal) categories are fully…
We give a new criterion guaranteeing existence of model structures left-induced along a functor admitting both adjoints. This works under the hypothesis that the functor induces idempotent adjunctions at the homotopy category level. As an…
In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the…
As several different formal systems with inequivalent syntax may describe equivalent semantics, it is possible to find `completions' to more expressive syntaxes that are semantically invariant. Doctrine theory, in the sense of Lawvere, is…