The equivalence between a monoidal category and a strict one has been proved by some authors such as Nguyen Duy Thuan [8], Christian Kassel [2], Peter Schauenburg [7]. In this paper, we show another proof of the problem by constructing a strict monoidal category M(C) consisting of M -functors and M morphisms of a category C and we prove C is equivalent to it. The proof is based on a basic chara...

Leibniz’s conception of bodies seems to be a puzzling theory. Bodies are seen as aggregates of monads and as wellfounded phenomena. This has initiated controversy and unending discussions. The paper attempts to resolve the apparent inconsistencies by a new and formally spirited reconstruction of Leibniz’s theory of monads and perception, on the one hand, and a (re-)formulation and precisation o...

Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a high-level language for theory of computation, flexible enough to allow abstracting away the low level implementation details when they are irrelevant, or t...

We discuss and compare the notions of braided and coboundary monoidal categories. Coboundary monoidal categories are analogues of braided monoidal categories in which the role of the braid group is replaced by the cactus group. We focus on the categories of representations of quantum groups and crystals and explain how while the former is a braided monoidal category, this structure does not pas...

We give a framework for combining n monads on the same category via distributive laws satisfying Yang-Baxter equations, extending the classical result of Barr and Wells which combines two monads via one distributive law. We show that this corresponds to iterating n-times the process of taking the 2-category of monads in a 2-category, extending the result of Street characterising distributive la...

We introduce the notion of an equational lifting monad: a commutative strong monad satisfying one additional equation (valid for monads arising from partial map classifiers). We prove that any equational lifting monad has a representation by a partial map classifier such that the Kleisli category of the former fully embeds in the partial category of the latter. Thus equational lifting monads pr...

Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being established a few years later. Monads, although mathematically the less direct and less malleable formulation, rapidly gained precedence. A generation later, the definition of monad began to appear extensively in theoretic...

We introduce a method to lift monads on the base category of a fibration to its total category using codensity monads. This method, called codensity lifting, is applicable to various fibrations which were not supported by the categorical >>-lifting. After introducing the codensity lifting, we illustrate some examples of codensity liftings of monads along the fibrations from the category of preo...