An Elementary Characterization of the Category of (Free) Relational Systems.
It is well-known that the composition of two functors between categories yields a functor again, whenever it exists. The same is true for functors which preserve in a certain sense the structure of symmetric monoidal categories. Considering small symmetric monoidal categories with an additional structure as objects and the structure preserving functors between them as morphisms one obtains different kinds of functor categories, which are even dt-symmetric categories.
Clone properties are the properties expressible by the first order sentence of the clone language. The present paper is a contribution to the field of problems asking when distinct sentences of the language determine distinct topological properties. We fully clarify the relations among the rigidity, the fix-point property, the image-determining property and the coconnectedness.
In a groupoid, consider arbitrarily parenthesized expressions on the variables where each appears once and all variables appear in order of their indices. We call these expressions -ary formal products, and denote the set containing all of them by . If are distinct, the statement that and are equal for all values of is a generalized associative law. Among other results, we show that many small groupoids are completely dissociative, meaning that no generalized associative law holds...