Dualisability versus residual character: a theorem and a counterexample
From MaRDI portal
Publication:886225
DOI10.1016/j.jpaa.2006.10.001zbMath1119.08001OpenAlexW2087543767WikidataQ124793329 ScholiaQ124793329MaRDI QIDQ886225
Jane G. Pitkethly, Ross Willard, Brian A. Davey
Publication date: 26 June 2007
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpaa.2006.10.001
Structure theory of algebraic structures (08A05) Semilattices (06A12) Subdirect products and subdirect irreducibility (08B26)
Related Items (5)
Flat unars: the primal, the semi-primal and the dualisable ⋮ Some structural and residual properties of 2-semilattices ⋮ Dualizability of automatic algebras. ⋮ Natural extensions and profinite completions of algebras ⋮ Natural dualities, nilpotence and projective planes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Residually small varieties of semigroups
- Natural dualities for quasivarieties generated by a finite commutative ring.
- Near unanimity: An obstacle to general duality theory
- Dualizability and graph algebras
- Natural dualities for semilattice-based algebras
- Dualisability. Unary algebras and beyond
- Standard topological algebras: syntactic and principal congruences and profiniteness
- DUALISABILITY OF FINITE SEMIGROUPS
- Nilpotent groups are not dualizable
- Self-Rectangulating Varieties of Type 5
- Congruence Relations in Semi-Lattices
- Algebras Whose Congruence Lattices are Distributive.
- Residual smallness relativized to congruence types. I
- Dualisability of \(p\)-semilattices
- Full duality among graph algebras and flat graph algebras
This page was built for publication: Dualisability versus residual character: a theorem and a counterexample