Related papers: Aczel-Mendler Bisimulations in a Regular Category
In this paper we put forward the definition of particular subsets on a unital C*-algebra, that we call isocones, and which reduce in the commutative case to the set of continuous non-decreasing functions with real values for a partial order…
We develop general foundations of topological algebra over a linearly topologized ring k in a format applicable to both formal schemes and analytic adic spaces. We are especially interested in determining exact closed tensor categories of…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We show that, with some technical conditions, an abelian category can be embedded into the category of bimodules over a ring. The case of semisimple rigid monoidal categories is studied in more detail.
Many of the properties of sectional category, topological complexity and homotopic distance are in fact derived from a small number of basic properties, which, once established, lead to all the others without further recourse to topology.…
We describe the structure of bimodules (over finite dimensional algebras) which have the property that the functor of tensoring with such a bimodule sends any module to a projective module. The main result is that all such bimodules are…
Adhesive and quasiadhesive categories provide a general framework for the study of algebraic graph rewriting systems. In a quasiadhesive category any two regular subobjects have a join which is again a regular subobject. Vice versa, if…
Milner's bigraphs are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the pi-calculus and the Ambient calculus. This paper is only concerned with…
This paper generalizes in the affine symmetric group the notion of Coxeter sortable (or c-sortable for short) elements, as well as the classical bijection between c-sortable elements and c-noncrossing partitions defined by Reading in finite…
A bisimulation for a coalgebra of a functor on the category of sets can be described via a coalgebra in the category of relations, of a lifted functor. A final coalgebra then gives rise to the coinduction principle, which states that two…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…
We study bisimulations for useful description logics. The simplest among the considered logics is $\mathcal{ALC}_{reg}$ (a variant of PDL). The others extend that logic with inverse roles, nominals, quantified number restrictions, the…
In tasks like semantic parsing, instruction following, and question answering, standard deep networks fail to generalize compositionally from small datasets. Many existing approaches overcome this limitation with model architectures that…
Kleisli bicategories are a natural environment in which the combinatorics involved in various notions of algebraic theory can be handled in a uniform way. The setting allows a clear account of comparisons between such notions. Algebraic…
Closure spaces are a generalisation of topological spaces obtained by removing the idempotence requirement on the closure operator. We adapt the standard notion of bisimilarity for topological models, namely Topo-bisimilarity, to closure…
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 cocycle category H(X,Y) is defined for objects X and Y in a model category, and it is shown that the set of morphisms [X,Y] is isomorphic to the set of path components of H(X,Y) provided the ambient model category is right proper and…
We introduce the theory of biset functors defined on finite categories. Previously, biset functors have been defined on groups, and in that context they are closely related to Mackey functors. Standard examples on groups include…
The term ``Boolean category'' should be used for describing an object that is to categories what a Boolean algebra is to posets. More specifically, a Boolean category should provide the abstract algebraic structure underlying the proofs in…