Related papers: Weak bisimulation for coalgebras over order enrich…
We show that, under some mild conditions, a bialgebra in an abelian and coabelian braided monoidal category has a weak projection onto a formally smooth (as a coalgebra) sub-bialgebra with antipode; see Theorem 1.12. In the second part of…
Simulations and bisimulations are ubiquitous in the study of concurrent systems and modal logics of various types. Besides classical relational transition systems, relevant system types include, for instance, probabilistic, weighted,…
Language theory, symbolic dynamics, modelisation of viral insertion into the genetic code of a host cell motivate the introduction of new types of bialgebras whose coalgebra parts are not necessarily coassociative. One of the aim of this…
This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
Like notions of process equivalence, behavioural preorders on processes come in many flavours, ranging from fine-grained comparisons such as ready simulation to coarse-grained ones such as trace inclusion. Often, such behavioural preorders…
The concept of_refinement_ in type theory is a way of reconciling the "intrinsic" and the "extrinsic" meanings of types. We begin with a rigorous analysis of this concept, settling on the simple conclusion that the type-theoretic notion of…
We study a coderivation from a cobimodule into a coalgebra. Vector cofields are defined by the action of a codual bicomodule on a coalgebra. This action is induced by a codifferential. A construction of a codual object in the category of…
We study weak commutative algebras in a symmetric monoidal model category $\mathscr{M}$. We provide a model structure on these algebras for any symmetric monoidal model category that is combinatorial and left proper. Our motivation was to…
We show how to "interleave" the monad for operads and the monad for contractions on the category \coll of collections, to construct the monad for the operads-with-contraction of Leinster. We first decompose the adjunction for operads and…
In the first part of this article, we give an analysis of the free monad sequence in non-cocomplete categories, with the needed colimits explicitly parametrized. This enables us to state a more finely grained functoriality principle for…
State-of-the-art object grasping methods rely on depth sensing to plan robust grasps, but commercially available depth sensors fail to detect transparent and specular objects. To improve grasping performance on such objects, we introduce a…
This paper lays some of the foundations for working with not-necessarily-commutative bialgebras and their categories of comodules in $\infty$-categories. We prove that the categories of comodules and modules over a bialgebra always admit…
We review the theory of weakly coupled oscillators for smooth systems. We then examine situations where application of the standard theory falls short and illustrate how it can be extended. Specific examples are given to non-smooth systems…
We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…
In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final…
We study discrete opfibration classifiers in enhanced 2-categories and show how, under suitable hypotheses, such classifiers can be endowed with the structure of a (lax or pseudo-)T-algebra and classify strict discrete opfibrations in…
Bisimilarity is a central notion for coalgebras. In recent work, Geuvers and Jacobs suggest to focus on apartness, which they define by dualising coalgebraic bisimulations. This yields the possibility of finite proofs of distinguishability…
We discuss walking behavior in gauge theories and weak first-order phase transitions in statistical physics. Despite appearing in very different systems (QCD below the conformal window, the Potts model, deconfined criticality) these two…
Under appropriate conditions, if one picks a commutative algebra A with action of group G in braided monoidal category C, the category of A modules in C obtains a natural crossed G-braided structure. In the case of general commutative…