Add to ORKGIn this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B satisfy precisely the same identities? (2) Do they satisfy the same quasi-identities? (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
We study the algorithmic complexity of determining whether a system of polynomial equations over a f...
An algorithm for producing identifies which hold in any given finite quasigroup is described. Identi...
AbstractConfirming a conjecture of Hjorth and Kechris (Ann. Pure Appl. Logic 82 (1996) 221–272), we ...
In this paper we consider the complexity of several problems involving finite algebraic structures. ...
For a fixed finite algebra ?, we consider the decision problem SysTerm(?): does a given system of te...
An algebra $\cal A$ is finitely presented if there is a finite set G of generator symbols, a finite...
AbstractA quasigroup identity is of Bol–Moufang type if two of its three variables occur once on eac...
In mathematics, automorphisms of algebraic structures play an important role. Automorphisms capture ...
We associate to each variety of algebras of finite signature a function on the positive integers cal...
This research studies three-element unary algebras to determine which of them are standard. A quasi-...
We associate to each variety of algebras of finite signature a function on the positive integers cal...
This paper presents a complete classification of the complexity of the SAT and equivalence problems ...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
Part of the Algebra Commons, and the Numerical Analysis and Scientific Computing Commons The complet...
This paper presents a new method for obtaining small algebras to check the admissibility - equivalen...
We study the algorithmic complexity of determining whether a system of polynomial equations over a f...
An algorithm for producing identifies which hold in any given finite quasigroup is described. Identi...
AbstractConfirming a conjecture of Hjorth and Kechris (Ann. Pure Appl. Logic 82 (1996) 221–272), we ...
In this paper we consider the complexity of several problems involving finite algebraic structures. ...
For a fixed finite algebra ?, we consider the decision problem SysTerm(?): does a given system of te...
An algebra $\cal A$ is finitely presented if there is a finite set G of generator symbols, a finite...
AbstractA quasigroup identity is of Bol–Moufang type if two of its three variables occur once on eac...
In mathematics, automorphisms of algebraic structures play an important role. Automorphisms capture ...
We associate to each variety of algebras of finite signature a function on the positive integers cal...
This research studies three-element unary algebras to determine which of them are standard. A quasi-...
We associate to each variety of algebras of finite signature a function on the positive integers cal...
This paper presents a complete classification of the complexity of the SAT and equivalence problems ...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
Part of the Algebra Commons, and the Numerical Analysis and Scientific Computing Commons The complet...
This paper presents a new method for obtaining small algebras to check the admissibility - equivalen...
We study the algorithmic complexity of determining whether a system of polynomial equations over a f...
An algorithm for producing identifies which hold in any given finite quasigroup is described. Identi...
AbstractConfirming a conjecture of Hjorth and Kechris (Ann. Pure Appl. Logic 82 (1996) 221–272), we ...