Related papers: Stabilized profunctors and stable species of struc…
We construct a model structure on simplicial profinite sets such that the homotopy groups carry a natural profinite structure. This yields a rigid profinite completion functor for spaces and pro-spaces. One motivation is the \'etale…
Structured and decorated cospans are broadly applicable frameworks for building bicategories or double categories of open systems. We streamline and generalize these frameworks using central concepts of double category theory. We show that,…
Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…
Motivated by problems in categorical database theory, we introduce and compare two notions of presentation for profunctors, uncurried and curried, which arise intuitively from thinking of profunctors either as functors C^op x D -> Set or…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
For any ring R we construct two triangulated categories, each admitting a functor from R-modules that sends projective and injective modules to 0. When R is a quasi-Frobenius or Gorenstein ring, these triangulated categories agree with each…
A convenient bicategory of topological stacks is constructed which is both complete and Cartesian closed. This bicategory, called the bicategory of compactly generated stacks, is the analogue of classical topological stacks, but for a…
Framings provide a way to construct Quillen functors from simplicial sets to any given model category. A more structured set-up studies stable frames giving Quillen functors from spectra to stable model categories. We will investigate how…
Certain results involving "higher structures" are not currently accessible to computer formalization because the prerequisite $\infty$-category theory has not been formalized. To support future work on formalizing $\infty$-category theory…
The groupoid of finite sets has a "canonical" structure of a symmetric 2-rig with the sum and product respectively given by the coproduct and product of sets. This 2-rig $\widehat{\mathbb{F}\mathbb{S} et}$ is just one of the many…
Recently, there has been growing interest in bicategorical models of programming languages, which are "proof-relevant" in the sense that they keep distinct account of execution traces leading to the same observable outcomes, while assigning…
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…
We rewrite simplicially the standard definitions of a complete first order theory, a model of it, and various characterisations of stability of a complete first order theory. In our reformulations the simplicial language replaces the…
Fibrations over a category $B$, introduced to category theory by Grothendieck, encode pseudo-functors $B^{op} \rightsquigarrow {\bf Cat}$, while the special case of discrete fibrations encode presheaves $B^{op} \to {\bf Set}$. A two-sided…
We study monoidal 2-categories and bicategories in terms of categorical extensions and the cohomological data they determine in appropriate cohomology theories with coefficients in Picard groupoids. In particular, we analyze the hierarchy…
We define the notion of an indexed profunctor over a 2-category, and use it to develop an abstract theory of limits. The theory subsumes (conical) limits, weighted limits, ends and Kan extensions. Results include an abstract version of the…
The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…
We prove a new localization theorem for stable model categories if the localizing subcategory is generated by a precovering class in the model category. We use this to show how one may explicitly realize certain Bousfield localization…
Neural networks systematically fail at compositional generalization -- producing correct outputs for novel combinations of known parts. We show that this failure is architectural: compositional generalization is equivalent to functoriality…
This is the second introductory paper concerning structures called rootoids and protorootoids, the definition of which is abstracted from formal properties of Coxeter groups with their root systems and weak orders. The ubiquity of…