相关论文: Pseudo-categories

A generalization of the notion of an $\infty$-category is presented, allowing for ($\infty$-)cat(egorie)s that may have non-invertible higher morphisms.

In this paper we give sufficient conditions under which a subsemigroup of a topological group is a subgroup, adding to the results given in \cite{Kosh, can, axioms, forum, Hof, cc, locally} where conditions exist (such as locally…

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 classify the thick subcategories of discrete derived categories. To do this we introduce certain generating sets called arc-collections which correspond to configurations of non-crossing arcs on a geometric model. We show that every…

We describe a perfect correspondence between skew monoidal categories and certain generalised multicategories, called skew multicategories, that arise in nature.

We explain the sense in which a warping on a monoidal category is the same as a pseudomonad on the corresponding one-object bicategory, and we describe extensions of this to the setting of skew monoidal categories: these are a…

The paper introduces the concept of asynchronous pseudo-system. Its purpose is to correct/generalize/continue the study of the asynchronous systems (the models of the asynchronous circuits) that has been started in [1], [2].

For each of the following conditions, we characterize the pseudovarieties of semigroups V that satisfy it: (i) every epimorphism to a member of V is onto; (ii) every epimorphism to a finite semigroup with domain a member of V is onto; (iii)…

We introduce a notion of globular multicategory with homomorphism types. These structures arise when organizing collections of "higher category-like" objects such as type theories with identity types. We show how these globular…

Proofs (sequent calculus, natural deduction) and imperative algorithms (pseudocodes) are two well-known coexisting concepts. Then what is their relationship? Our answer is that \[ imperative\ algorithms\ =\ proofs\ with\ cuts \] This…

We show how the notion of intercategory encompasses a wide variety of three-dimensional structures from the literature, notably duoidal categories, monoidal double categories, cubical bicategories, double bicategories and Gray categories.…

The difference between the terms additivity and extensivity, as well as their respective negations, is critically analyzed and illustrated with a few examples. The concepts of subadditivity, pseudo-additivity, and pseudo-extensivity are…

Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…

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…

Given a 2-category $\mathcal{A}$, a $2$-functor $\mathcal{A} \overset {F} {\longrightarrow} \mathcal{C}at$ and a distinguished 1-subcategory $\Sigma \subset \mathcal{A}$ containing all the objects, a $\sigma$-cone for $F$ (with respect to…

We define biprops as a generalization of coloured props and of symmetric weak multicategories. These are bicategories whose objects form a free monoid. They are equipped with some structure resembling a symmetric strict tensor product. We…

If a compact closed category has finite products or finite coproducts then it in fact has finite biproducts, and so is semi-additive.

Pseudodiagrams are knot or link diagrams where some of the crossing information is missing. Pseudoknots are equivalence classes of pseudodiagrams, where equivalence is generated by a natural set of Reidemeister moves. In this paper, we…

We introduce the notion of a relative pseudomonad, which generalises the notion of a pseudomonad, and define the Kleisli bicategory associated to a relative pseudomonad. We then present an efficient method to define pseudomonas on the…

Precategories generalize both the notions of strict $n$-category and sesquicategory: their definition is essentially the same as the one of strict $n$-categories, excepting that we do not require the various interchange laws to hold. Those…