Dualisability versus residual character: a theorem and a counterexample
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4035895 (Why is no real title available?)
- scientific article; zbMATH DE number 3658051 (Why is no real title available?)
- scientific article; zbMATH DE number 1226180 (Why is no real title available?)
- Algebras Whose Congruence Lattices are Distributive.
- Congruence Relations in Semi-Lattices
- DUALISABILITY OF FINITE SEMIGROUPS
- Dualisability of \(p\)-semilattices
- Dualisability. Unary algebras and beyond
- Dualizability and graph algebras
- Full duality among graph algebras and flat graph algebras
- Natural dualities for quasivarieties generated by a finite commutative ring.
- Natural dualities for semilattice-based algebras
- Near unanimity: An obstacle to general duality theory
- Nilpotent groups are not dualizable
- Residual smallness relativized to congruence types. I
- Residually small varieties of semigroups
- Self-Rectangulating Varieties of Type 5
- Standard topological algebras: syntactic and principal congruences and profiniteness
Cited in
(12)- Supernilpotence prevents dualizability
- Naturally dualizable algebras omitting types 1 and 5 have a cube term
- Dualizability of automatic algebras.
- Irresponsibility indicates an inability to be strong
- scientific article; zbMATH DE number 937382 (Why is no real title available?)
- Natural dualities, nilpotence and projective planes
- Natural extensions and profinite completions of algebras
- Natural dualities for semilattice-based algebras
- Flat unars: the primal, the semi-primal and the dualisable
- scientific article; zbMATH DE number 437428 (Why is no real title available?)
- Dualisability of \(p\)-semilattices
- Some structural and residual properties of 2-semilattices
This page was built for publication: Dualisability versus residual character: a theorem and a counterexample
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q886225)