Related papers: Restriction categories III: colimits, partial limi…

Badzioch showed that in the category of simplicial sets each homotopy algebra of a Lawvere theory is weakly equivalent to a strict algebra. In seeking to extend this result to other contexts Rosicky observed a key point to be that each…

Building on a previous definition of homotopy limit of model categories, we give a definition of homotopy colimit of model categories. Using the complete Segal space model for homotopy theories, we verify that this definition corresponds to…

Generalizing a definition of homotopy fiber products of model categories, we give a definition of the homotopy limit of a diagram of left Quillen functors between model categories. As has been previously shown for homotopy fiber products,…

We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…

In this paper, we present a comprehensive system for the treatment of the topic of limits--conceptually, computationally, and formally. The system addresses fundamental linguistic flaws in the standard presentation of limits, which attempts…

A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…

For a given category B we are interested in studying internal categorical structures in B. This work is the starting point, where we consider reflexive graphs and precategories (i.e., for the purpose of this note, a simplicial object…

We present some results on (co)limits of diagrams in $\infty$-categories, as well as those in $(n, 1)$-categories. In particular, we deduce a way to reshape colimit diagrams into simplicial ones, and a characterisations of $n$-cofinality…

For a diagram of simplicial combinatorial model categories, we show that the associated lax limit, endowed with the projective model structure, is a presentation of the lax limit of the underlying $\infty$-categories. Our approach can also…

Abstract inner automorphisms can be used to promote any category into a 2-category, and we study two-dimensional limits and colimits in the resulting 2-categories. Existing connected colimits and limits in the starting category become…

The development of machine learning in particular and artificial intelligent in general has been strongly conditioned by the lack of an appropriated framework to specify and integrate learning processes, data transformation processes and…

The basic concepts in category theory are representables, adjoints, limits, and monads. In this talk, we define the notion of a Kan extension and show that this notion encompasses these concepts.

We define a pseudometric on the set of all unbounded subsets of a metric space. The Kolmogorov quotient of this pseudometric space is a complete metric space. The definition of the pseudometric is guided by the principle that two unbounded…

In this paper we define several notions of term expansion, used to define terms with less sharing, but with the same computational properties of terms typable in an intersection type system. Expansion relates terms typed by associative,…

An itegory is a restriction category with a Kleene wand. Cockett, D\'iaz-Bo\"ils, Gallagher, and Hrube\v{s} briefly introduced Kleene wands to capture iteration in restriction categories arising from complexity theory. The purpose of this…

In a previous article, we introduced notions of finiteness obstruction, Euler characteristic, and L^2-Euler characteristic for wide classes of categories. In this sequel, we prove the compatibility of those notions with homotopy colimits of…

In this paper we develop homotopy theoretical methods for studying diagrams. In particular we explain how to construct homotopy colimits and limits in an arbitrary model category. The key concept we introduce is that of a model…

For any length category, we establish a set of rules (necessary and sufficient) that ensure a partial order on the isomorphism classes of simple objects such that the category is equivalent to the category of finite dimensional…

This paper introduces a declarative framework to specify and reason about distributions of data over computing nodes in a distributed setting. More specifically, it proposes distribution constraints which are tuple and equality generating…

For a collection of subcategories satisfying a fixed set of conditions, for example thick subcategories of a triangulated category, we define a topological space called classifying space of subcategories. We show that this space classifies…