Recommendations
Cites work
- A generalization of the duality compactness theorem
- An algebra that is dualizable but not fully dualizable
- Closed systems of functions and predicates
- Dualisability. Unary algebras and beyond
- Endoprimal distributive lattices are endodualisable
- Full but not strong dualities at the finite level: extending the realm
- Full does not imply strong, does it?
- scientific article; zbMATH DE number 1226180 (Why is no real title available?)
- Not every full duality is strong!
- On quasi primal algebras
- Optimal natural dualities. II: General theory
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- Representation of Distributive Lattices by means of ordered Stone Spaces
- Structural entailment
- Structural reducts and the full implies strong problem
- The syntax and semantics of entailment in duality theory
- Using coloured ordered sets to study finite-level full dualities
Cited in
(17)- Natural dualities in partnership
- New-from-old full dualities via axiomatisation
- Dualities and algebras with a near-unanimity term
- Piggyback dualities revisited
- Full dualisability is independent of the generating algebra
- Finite affine algebras are fully dualizable
- Duality for quasilattices and Galois connections
- OPTIMAL NATURAL DUALITIES: THE STRUCTURE OF FAILSETS
- Strong and full dualisability: three-element unary algebras
- Counting relations on Ockham algebras.
- On selected developments in the theory of natural dualities
- Gap theorems for robust satisfiability: Boolean CSPs and beyond
- Supernilpotence prevents dualizability
- Natural dualities for three classes of relational structures
- Using coloured ordered sets to study finite-level full dualities
- Multisorted dualisability: change of base
- Compatible relations on Heyting chains
This page was built for publication: The lattice of alter egos
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882399)
