Related papers: Propification and the Scalable Comonad
Semi-cosimplicial objects in the category of Hilbert spaces with isometries which are motivated by non-commutative probability theory, in particular by the distributional symmetry of spreadability, are introduced and systematically…
Reasoning modulo equivalences is natural for everyone, including mathematicians. Unfortunately, in proof assistants based on type theory, equality is appallingly syntactic and, as a result, exploiting equivalences is cumbersome at best.…
Convergent rewriting systems are well-known tools in the study of the word-rewriting problem. In particular, a presentation of a monoid by a finite convergent rewriting system gives an algorithm to decide the word problem for this monoid.…
We prove that a weak equivalence between cofibrant props induces a weak equivalence between the associated classifying spaces of algebras. This statement generalizes to the prop setting a homotopy invariance result which is well known in…
The problem of characterizing normed ordered spaces which admit a representation in the algebraic, order and norm sense as a subspace of $C(X)$, the space of all continuous functions on a compact Hausdorff space is a classical problem that…
We establish a highly flexible condition that guarantees that all colored symmetric operads in a symmetric monoidal model category are admissible, i.e., the category of algebras over any operad admits a model structure transferred from the…
When formalizing mathematics in (generalized predicative) constructive type theories, or more practically in proof assistants such as Coq or Agda, one is often using setoids (types with explicit equivalence relations). In this note we…
The category of (colored) props is an enhancement of the category of colored operads, and thus of the category of small categories. In this paper, the second in a series on "higher props," we show that the category of all small colored…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…
We construct a pairing, which we call factorization homology, between framed manifolds and higher categories. The essential geometric notion is that of a vari-framing of a stratified manifold, which is a framing on each stratum together…
If $\mathbf{C}$ is a category with pullbacks then there is a bicategory with the same objects as $\mathbf{C}$, spans as morphisms, and maps of spans as 2-morphisms, as shown by Benabou. Fong has developed a theory of "decorated" cospans,…
Reynold's parametricity theory captures the property that parametrically polymorphic functions behave uniformly: they produce related results on related instantiations. In dependently-typed programming languages, such relations and…
It is common to encounter symmetric monoidal categories $\mathcal{C}$ for which every object is equipped with an algebraic structure, in a way that is compatible with the monoidal product and unit in $\mathcal{C}$. We define this formally…
Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…
We discuss what it means for a symmetric monoidal category to be a module over a commutative semiring category. Each of the categories of (1) cartesian monoidal categories, (2) semiadditive categories, and (3) connective spectra can be…
We show that every braiding on a monoidal bicategory induces a monoidal structure on its bicategory of monoids, such that if the former is sylleptic or symmetric then the latter is braided or symmetric, respectively. This extends a classic…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
This article deals with the notion of factorability. Elements of a factorable group or monoid possess a normal form, which leads to a small complex homotopy equivalent to its bar complex, thus computing its homology. We investigate the…
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…
Let $\V$ be a symmetric monoidal model category and let $X$ be an object in $\V$. From this we can construct a new symmetric monoidal model category $Sp^{\Sigma}(\V,X)$ of symmetric spectra objects in $\V$ with respect to $X$, together with…