Algorithms for categorical equivalence

Clifford Bergman, Joel D. Berman · Mathematical Structures in Computer Science · 1998

This paper provides an algorithm that, given two finite algebras A and B each of arbitrary finite similarity type, determines whether or not A and B are categorically equivalent. Although the algorithm is not practical in general, we consider some conditions on the algebras that improve its performance.

Read the paper · More papers on PaperTik