AbstractSome general results are obtained for any equational class K whose members satisfy the conditions of the title. This yields a method for determining the length of finitely generated algebras in K. Included are applications to some relatively free modular lattices and algebras arising from some non-classical logics
In [4] we gave a construction of inherently nonfinitely based lattices which produced a wide variety...
The main result of this paper is that the class of congruence lattices of semilattices satisfies no...
AbstractWe describe a new way to construct large subdirectly irreducibles within an equational class...
AbstractSome general results are obtained for any equational class K whose members satisfy the condi...
The book is meant to serve two purposes. The first and more obvious one is to present state of the a...
For ages now, the literature has abounded with various graded algebras whose homogeneous components...
A variety (equational class) of lattices is said to be finitely based if there exists a finite set o...
summary:We obtain a simple construction for particular subclasses of several varieties of lattice ex...
AbstractFor a lattice L of finite length we denote by J(L) the set of all join-irreducible elements ...
We present a number of results related to the decidability and undecidability of various varieties o...
AbstractFast algorithms are presented which find the minimal nontrivial congruences, subalgebras, an...
We study in this thesis structures extending the classical notion of word. They are built from a par...
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
This paper continues the joint work [2] of the author with P. Jones. We describe all finitely genera...
Funding for open access charge: Universidad de Granada / CBUAIf m is an element of N \ (0, 1) and A ...
In [4] we gave a construction of inherently nonfinitely based lattices which produced a wide variety...
The main result of this paper is that the class of congruence lattices of semilattices satisfies no...
AbstractWe describe a new way to construct large subdirectly irreducibles within an equational class...
AbstractSome general results are obtained for any equational class K whose members satisfy the condi...
The book is meant to serve two purposes. The first and more obvious one is to present state of the a...
For ages now, the literature has abounded with various graded algebras whose homogeneous components...
A variety (equational class) of lattices is said to be finitely based if there exists a finite set o...
summary:We obtain a simple construction for particular subclasses of several varieties of lattice ex...
AbstractFor a lattice L of finite length we denote by J(L) the set of all join-irreducible elements ...
We present a number of results related to the decidability and undecidability of various varieties o...
AbstractFast algorithms are presented which find the minimal nontrivial congruences, subalgebras, an...
We study in this thesis structures extending the classical notion of word. They are built from a par...
AbstractLet V be a discriminator variety such that the class B={A∈V: A is simple and has no trivial ...
This paper continues the joint work [2] of the author with P. Jones. We describe all finitely genera...
Funding for open access charge: Universidad de Granada / CBUAIf m is an element of N \ (0, 1) and A ...
In [4] we gave a construction of inherently nonfinitely based lattices which produced a wide variety...
The main result of this paper is that the class of congruence lattices of semilattices satisfies no...
AbstractWe describe a new way to construct large subdirectly irreducibles within an equational class...