Categories, types, and structures: an introduction to category theory for the working computer scientist
Relation algebraic domain constructions
Theoretical Computer Science
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Fuzzy Sets and Systems - Special issue on fuzzy relations, part 1
Monomorphic characterization of n-ary direct products
Information Sciences: an International Journal - Relational methods in computer science
Comparing Two Different Approaches to Products in Abstract Relation Algebra
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Relation algebras, matrices, and multi-valued decision diagrams
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
| Hi-index | 0.00 |
The existence of relational products in categories of relations is strongly connected with the representability of that category. In this paper we propose a canonical weakening of the notion of a relational product. Unlike the strong version, any (small) category of relations can be embedded into a suitable category providing all weak relational products. Furthermore, we investigate the categorical properties of the new construction and prove several (weak) versions of propositions well-known for relational products.