Add to ORKGAbstract. A number of new results that say how to transfer the entailment relation between two different finite generators of a quasi-variety of algebras is presented. As their consequence, a well-known result saying that dualisability of a quasi-variety is independent of the generating algebra is derived. The transferral of endodualisability is also considere
Abstract. We show that a finite algebra must be inherently non-dualisable if the variety that it gen...
We investigate the dualisability problem for finite relational structures and highlight differences ...
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattic...
summary:A number of new results that say how to transfer the entailment relation between two differe...
Abstract. Results saying how to transfer the entailment in certain minimal and maximal ways and how ...
summary:Results saying how to transfer the entailment in certain minimal and maximal ways and how to...
We give a number of characterizations of structural entailment. In particular, we show that an alter...
We prove that if a quasivariety A generated by a finite family M of finite algebras has a multisorte...
We address the problem of proving that a finite algebraM is dualizable, or strongly dualizable, in t...
It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single fin...
peer reviewedThe main contribution of this paper is the construction of a strong duality for the var...
AbstractWe show that a finite algebra must be inherently non-dualisable if the variety that it gener...
Abstract. We give an example of a finite algebra which is dualizable but not fully dualizable in the...
Abstract. In natural duality theory, the piggybacking technique is a valuable tool for constructing ...
In (2), Brian Davey poses the question: "Which finite algebras admit a duality?" The answer to this ...
Abstract. We show that a finite algebra must be inherently non-dualisable if the variety that it gen...
We investigate the dualisability problem for finite relational structures and highlight differences ...
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattic...
summary:A number of new results that say how to transfer the entailment relation between two differe...
Abstract. Results saying how to transfer the entailment in certain minimal and maximal ways and how ...
summary:Results saying how to transfer the entailment in certain minimal and maximal ways and how to...
We give a number of characterizations of structural entailment. In particular, we show that an alter...
We prove that if a quasivariety A generated by a finite family M of finite algebras has a multisorte...
We address the problem of proving that a finite algebraM is dualizable, or strongly dualizable, in t...
It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single fin...
peer reviewedThe main contribution of this paper is the construction of a strong duality for the var...
AbstractWe show that a finite algebra must be inherently non-dualisable if the variety that it gener...
Abstract. We give an example of a finite algebra which is dualizable but not fully dualizable in the...
Abstract. In natural duality theory, the piggybacking technique is a valuable tool for constructing ...
In (2), Brian Davey poses the question: "Which finite algebras admit a duality?" The answer to this ...
Abstract. We show that a finite algebra must be inherently non-dualisable if the variety that it gen...
We investigate the dualisability problem for finite relational structures and highlight differences ...
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattic...