Classes of finite relations as initial abstract data types – II

AbstractIn this second part we extend the presentations in the first part to classes of multirelations, give presentations for algebraic and matrix theories in terms of (symmetric) strict monoidal categories, and give some weaker systems of axioms to present the classes of relations studied in the first part. (By ‘weaker systems of axioms’ we mean the following: these systems of axioms give bigger varieties in which the corresponding classes of relations are still initial algebras.