Add to ORKGThe relationship between full and strong dualities in the theory of natural dualities is not yet understood. Our aim in this paper is to present partial solutions to the Full versus Strong Problem, which asks if every full duality is necessarily strong. We introduce local versions of this problem and prove that they have affirmative solutions for four well-known classes of algebras: abelian groups, semilattices, relative Stone Heyting algebras and bounded distributive lattices. Along the way we provide some useful additions to the general theory
This thesis looks at algebras with positive primitively defined binary relations that are almost re-...
For the purpose of finding the quotient structure of multiple algebras such as groups, Abelian group...
For the purpose of finding the quotient structure of multiple algebras such as groups, Abelian group...
Abstract. We solve a variant of the Full Versus Strong Problem of natural duality theory, by giving ...
We prove that among finite graph algebras and among finite flat graph algebras, dualizability, full ...
We show that every finite Abelian algebra A from congruence-permutable varieties admits a full duali...
Abstract. In natural duality theory, the piggybacking technique is a valuable tool for constructing ...
We characterise the strongly dualisable three-element unary algebras and show that every fully duali...
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...
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattic...
Algebraic systems with partial operations have different ways to interpret equality between two term...
This thesis looks at algebras with positive primitively defined binary relations that are almost re-...
The techniques of natural duality theory are applied to certain finitely generated varieties of Heyt...
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-...
For the purpose of finding the quotient structure of multiple algebras such as groups, Abelian group...
For the purpose of finding the quotient structure of multiple algebras such as groups, Abelian group...
Abstract. We solve a variant of the Full Versus Strong Problem of natural duality theory, by giving ...
We prove that among finite graph algebras and among finite flat graph algebras, dualizability, full ...
We show that every finite Abelian algebra A from congruence-permutable varieties admits a full duali...
Abstract. In natural duality theory, the piggybacking technique is a valuable tool for constructing ...
We characterise the strongly dualisable three-element unary algebras and show that every fully duali...
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...
Abstract. While every finite lattice-based algebra is dualisable, the same is not true of semilattic...
Algebraic systems with partial operations have different ways to interpret equality between two term...
This thesis looks at algebras with positive primitively defined binary relations that are almost re-...
The techniques of natural duality theory are applied to certain finitely generated varieties of Heyt...
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-...
For the purpose of finding the quotient structure of multiple algebras such as groups, Abelian group...
For the purpose of finding the quotient structure of multiple algebras such as groups, Abelian group...