Lecture Notes in Computer Science, 1999, Volume 1563/1999, 163-172, DOI: 10.1007/3-540-49116-3_15

Complexity of Some Problems in Universal Algebra
Extended Abstract

Clifford Bergman and Giora Slutzki

View Related Documents

Abstract

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.
The complete vesion of this paper is available from http://www.math.iastate.edu/cbergman/papers.html

Fulltext Preview

Image of the first page of the fulltext document