Related papers: On abstract and concrete minions

We establish a categorical framework relating two canonical model constructions in first-order logic: the Henkin construction and compactness-based constructions via ultraproducts or saturation. By introducing a globally fixed set of Henkin…

We study a number of categorical quasi-uniform structures induced by functors. We depart from a category $\mathcal{C}$ with a proper $(\mathcal{E}, \mathcal{M})$-factorization system, then define the continuity of a $\mathcal{C}$-morphism…

Compositionality is at the heart of computer science and several other areas of applied category theory such as computational linguistics, categorical quantum mechanics, interpretable AI, dynamical systems, compositional game theory, and…

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…

We develop an analytical framework for Boolean Promise Constraint Satisfaction Problems (PCSPs) that studies polymorphisms through the notion of influence from Fourier analysis of Boolean functions. Extending the work of Brakensiek,…

We study concrete sheaf models for a call-by-value higher-order language with recursion. Our family of sheaf models is a generalization of many examples from the literature, such as models for probabilistic and differentiable programming,…

The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi \cite{BMR97}, is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft…

Unstable operations in a generalized cohomology theory E give rise to a functor from the category of algebras over E to itself which is a colimit of representable functors and a comonoid with respect to composition of such functors. In this…

For a rigid object $M$ in an algebraic triangulated category $\mathcal{T}$, a functor pr$(M)\to\mathcal{H}^{[-1,0]}({\rm proj}\, A)$ is constructed, which essentially takes an object to its `presentation', where pr$(M)$ is the full…

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

We prove a number of results of the following common flavor: for a category $\mathcal{C}$ of topological or uniform spaces with all manner of other properties of common interest (separation / completeness / compactness axioms), a group (or…

To characterize categorical constraints - associativity, commutativity and monoidality - in the context of quasimonoidal categories, from a cohomological point of view, we define the notion of a parity (quasi)complex. Applied to groups…

We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free commutative monoids. After recalling basic structural properties of the free commutative-monoid construction, we formalise and establish the…

We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…

We show that either of the two reasonable choices for the category of compact quantum groups is nice enough to allow for a plethora of universal constructions, all obtained "by abstract nonsense" via the adjoint functor theorem. This…

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise CSPs, we propose an algebraic framework for valued…

We provide a unified framework to study hierarchies of relaxations for Constraint Satisfaction Problems and their Promise variant. The idea is to split the description of a hierarchy into an algebraic part, depending on a minion capturing…

Let $\mathcal{X}$ be a resolving and contravariantly finite subcategory of $\rm{mod}\mbox{-}\Lambda$, the category of finitely generated right $\Lambda$-modules. We associate to $\mathcal{X}$ the subcategory…

Let $\mathcal{C}$ be an additive category. The nilpotent category $\mathrm{Nil} (\mathcal{C})$ of $\mathcal{C}$, consists of objects pairs $(X, x)$ with $X\in\mathcal{C}, x\in\mathrm{End}_{\mathcal{C}}(X)$ such that $x^n=0$ for some…