We characterise the strongly dualisable three-element unary algebras and show that every fully dualisable three-element unary algebra is strongly dualisable. It follows from the characterisation that, for dualisable three-element unary algebras, strong dualisability is equivalent to a weak form of injectivity
In (2), Brian Davey poses the question: "Which finite algebras admit a duality?" The answer to this ...
summary:Results saying how to transfer the entailment in certain minimal and maximal ways and how to...
summary:Results saying how to transfer the entailment in certain minimal and maximal ways and how to...
Abstract. We solve a variant of the Full Versus Strong Problem of natural duality theory, by giving ...
The relationship between full and strong dualities in the theory of natural dualities is not yet und...
We prove that among finite graph algebras and among finite flat graph algebras, dualizability, full ...
AbstractBeginning from any finite unary algebra with at least two fundamental operations, there is a...
summary:This paper introduces the notion of a strong retract of an algebra and then focuses on stron...
This thesis looks at algebras with positive primitively defined binary relations that are almost re-...
This thesis looks at algebras with positive primitively defined binary relations that are almost re-...
We address the problem of proving that a finite algebraM is dualizable, or strongly dualizable, in t...
AbstractWe investigate ways in which certain binary homomorphisms of a finite algebra can guarantee ...
This thesis looks at algebras with positive primitively defined binary relations that are almost re-...
Abstract. We give an example of a finite algebra which is dualizable but not fully dualizable in the...
Abstract. Results saying how to transfer the entailment in certain minimal and maximal ways and how ...
In (2), Brian Davey poses the question: "Which finite algebras admit a duality?" The answer to this ...
summary:Results saying how to transfer the entailment in certain minimal and maximal ways and how to...
summary:Results saying how to transfer the entailment in certain minimal and maximal ways and how to...
Abstract. We solve a variant of the Full Versus Strong Problem of natural duality theory, by giving ...
The relationship between full and strong dualities in the theory of natural dualities is not yet und...
We prove that among finite graph algebras and among finite flat graph algebras, dualizability, full ...
AbstractBeginning from any finite unary algebra with at least two fundamental operations, there is a...
summary:This paper introduces the notion of a strong retract of an algebra and then focuses on stron...
This thesis looks at algebras with positive primitively defined binary relations that are almost re-...
This thesis looks at algebras with positive primitively defined binary relations that are almost re-...
We address the problem of proving that a finite algebraM is dualizable, or strongly dualizable, in t...
AbstractWe investigate ways in which certain binary homomorphisms of a finite algebra can guarantee ...
This thesis looks at algebras with positive primitively defined binary relations that are almost re-...
Abstract. We give an example of a finite algebra which is dualizable but not fully dualizable in the...
Abstract. Results saying how to transfer the entailment in certain minimal and maximal ways and how ...
In (2), Brian Davey poses the question: "Which finite algebras admit a duality?" The answer to this ...
summary:Results saying how to transfer the entailment in certain minimal and maximal ways and how to...
summary:Results saying how to transfer the entailment in certain minimal and maximal ways and how to...
DOI
Add to ORKG