Complexity of some problems in universal algebra extended abstract

Authors:
Clifford Bergman;Giora Slutzki
Affiliations:
Department of Mathematics, Iowa State University, Ames, Iowa;Department of Computer Science, Iowa State University, Ames, Iowa
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 5
Cited 0

Fundamentals of algebraic specification 2: module specifications and constraints

Fundamentals of algebraic specification 2: module specifications and constraints
A Specifier's Introduction to Formal Methods

Computer
A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
Complexity of finitely presented algebras

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Lower bounds for natural proof systems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.