Complexity of Some Problems in Universal Algebra

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?

[1]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[2]  Jeannette M. Wing.  A specifier's introduction to formal methods , 1990, Computer.

[3]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[4]  R. McKenzie,et al.  Algebras, Lattices, Varieties , 1988 .

[5]  W. Taylor.  Equational logic , 1979 .

[6]  J. Kalicki.  On comparison of finite algebras , 1952 .

[7]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[8]  Giora Slutzki,et al.  Computational Complexity of Term-Equivalence , 1999, Int. J. Algebra Comput..

[9]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[10]  S. Burris.  Computers and universal algebra: some directions , 1995 .

[11]  Dexter Kozen,et al.  Complexity of finitely presented algebras , 1977, STOC '77.

[12]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[13]  George Gratzer,et al.  Universal Algebra , 1979 .