Abstract Because an exact pairing between an object and its dual is extraordinarily natural in the object, ideas of the paper [St4] apply to yield a definition of dualization for a pseudomonoid in any autonomous monoidal bicategory as base; this is an improvement on [DS; Definition 11, page 114]. We analyse the dualization notion in depth. An example is the concept of autonomous (which, usually...

In this paper we develops a categorical theory of relations and use this formulation to define the notion of quantization for relations. Categories of relations are defined in the context of symmetric monoidal categories. They are shown to be symmetric monoidal categories in their own right and are found to be isomorphic to certain categories of A−A bicomodules. Properties of relations are defi...

Lyubashenko has described enriched 2–categories as categories enriched over V–Cat, the 2–category of categories enriched over a symmetric monoidal V. This construction is the strict analogue for V–functors in V–Cat of Brian Day’s probicategories for V–modules in V–Mod. Here I generalize the strict version to enriched n–categories for k–fold monoidal V. The latter is defined as by Balteanu, Fied...

It is well known that the existence of a braiding in a monoidal category V allows many structures to be built upon that foundation. These include a monoidal 2-category V-Cat of enriched categories and functors over V , a monoidal bicategory V-Mod of enriched categories and modules, a category of operads in V and a 2-fold monoidal category structure on V . We will begin by focusing our expositio...

Although uniication algorithms have been developed for numerous equational theories there is still a lack of general methods. In this paper we apply algebraic techniques to the study of a whole class of theories, which we call monoidal. Our approach leads to general results on the structure of uniica-tion algorithms and the uniication type of such theories. An equational theory is monoidal if i...

It is shown that for every monoidal bi-closed category C left and right (semi)dualization by means of the unit object not only defines a pair of adjoint functors, but that these functors are monoidal as functors from C, the dual monoidal category of C into the transposed monoidal category C. We, thus, generalize the case of a symmetric monoidal category, where this kind of dualization is a spec...