AbstractWe investigate ways in which certain binary homomorphisms of a finite algebra can guarantee its dualisability. Of particular interest are those binary homomorphisms which are lattice, flat-semilattice or group operations. We prove that a finite algebra which has a pair of lattice operations amongst its binary homomorphisms is dualisable. As an application of this result, we find that every finite unary algebra can be embedded into a dualisable algebra. We develop some general tools which we use to prove the dualisability of a large number of unary algebras. For example, we show that the endomorphisms of a finite cyclic group are the operations of a dualisable unary algebra
We make a start on one of George McNulty's Dozen Easy Problems: “Which finite automatic algebras are...
Abstract Traditionally in natural duality theory the algebras carry no topology and the objects on t...
We make a start on one of George McNulty's Dozen Easy Problems: “Which finite automatic algebras are...
AbstractWe investigate ways in which certain binary homomorphisms of a finite algebra can guarantee ...
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattic...
AbstractBeginning from any finite unary algebra with at least two fundamental operations, there is a...
Abstract. We give an example of a finite algebra which is dualizable but not fully dualizable in the...
In (2), Brian Davey poses the question: "Which finite algebras admit a duality?" The answer to this ...
Traditionally in natural duality theory the algebras carry no topology and the objects on the dual s...
A finite algebra A=(A; F) is dualizable if there exists a discrete topological relational structure ...
We address the problem of proving that a finite algebraM is dualizable, or strongly dualizable, in t...
This paper investigates profinite completions of residually finite algebras, drawing on ideas from t...
This paper investigates profinite completions of residually finite algebras, drawing on ideas from t...
We describe the inherently non-dualisable finite algebras from some semigroup related classes. The c...
AbstractBeginning from any finite unary algebra with at least two fundamental operations, there is a...
We make a start on one of George McNulty's Dozen Easy Problems: “Which finite automatic algebras are...
Abstract Traditionally in natural duality theory the algebras carry no topology and the objects on t...
We make a start on one of George McNulty's Dozen Easy Problems: “Which finite automatic algebras are...
AbstractWe investigate ways in which certain binary homomorphisms of a finite algebra can guarantee ...
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattic...
AbstractBeginning from any finite unary algebra with at least two fundamental operations, there is a...
Abstract. We give an example of a finite algebra which is dualizable but not fully dualizable in the...
In (2), Brian Davey poses the question: "Which finite algebras admit a duality?" The answer to this ...
Traditionally in natural duality theory the algebras carry no topology and the objects on the dual s...
A finite algebra A=(A; F) is dualizable if there exists a discrete topological relational structure ...
We address the problem of proving that a finite algebraM is dualizable, or strongly dualizable, in t...
This paper investigates profinite completions of residually finite algebras, drawing on ideas from t...
This paper investigates profinite completions of residually finite algebras, drawing on ideas from t...
We describe the inherently non-dualisable finite algebras from some semigroup related classes. The c...
AbstractBeginning from any finite unary algebra with at least two fundamental operations, there is a...
We make a start on one of George McNulty's Dozen Easy Problems: “Which finite automatic algebras are...
Abstract Traditionally in natural duality theory the algebras carry no topology and the objects on t...
We make a start on one of George McNulty's Dozen Easy Problems: “Which finite automatic algebras are...