Previous work has axiomatised the cardinality operation in relation algebras, which counts the number of edges of an unweighted graph. We generalise the cardinality axioms to Stone relation algebras, which model weighted graphs, and study the relationships between various axioms for cardinality. This results in simpler cardinality axioms also for relation algebras. We give sufficient conditions for the representability of Stone relation algebras and for Stone relation algebras to be relation algebras.
翻译:先前的研究已在关系代数中公理化了基数运算,该运算用于计算无权图中边的数量。我们将基数公理推广至Stone关系代数(该代数用于建模加权图),并研究不同基数公理之间的关系。这一推广也为关系代数带来了更简洁的基数公理。我们给出了Stone关系代数可表示性以及Stone关系代数成为关系代数的充分条件。