Complexity of some problems in universal algebra extended abstract
Clifford Bergman, Giora Slutzki · 1999
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite universal algebras A and B, these problems ask: (1) Do A and B satisfy precisely the same identities? (2) Do they satisfy the same quasi-identities? and (3) Do A and B have the same set of term operations? In addition to the general case in which we allow arbitrary (finite) algebras, we consider each of these problems under the restrictions that all operations are unary, and that A and B have cardinality two. We briefly discuss the relationship of these problems to algebraic specification theory. There are several relationships between mathematical structures that might be considered "fundamental". First and foremost is certainly t...