The main aim of the paper is to investigate all possible natural dualities for quasivarieties generated by finite algebras (and, more generally, by finite algebraic structures, called here \textit{base structures}). The paper offers new insight into the relationship between the concepts of duality, full duality and strong duality. In particular, it reveals a new understanding of full dualities at the finite level.NEWLINENEWLINEA base structure \(\langle M;F,R\rangle\) is a finite set \(M\) endowed with a family \(F\) of finitary partial operations and a family \(R\) of finitary relations. The authors compare different base structures on the same set \(M\) by the relation \(\sqsubseteq\) of being \textit{a structural reduct}. This is a quasi-order on the set of all base structures on \(M\). By the natural factorization we obtain a doubly algebraic lattice \({\mathcal S}_M\).NEWLINENEWLINEFor a fixed base structure \({\mathbf M}=\langle M;F,R\rangle\), the authors consider the base structures compatible with \({\mathbf M}\). These structures form a complete sublattice \({\mathcal A}_{\mathbf M}\) of the lattice \({\mathcal S}_M\). This sublattice is called the \textit{lattice of alter egos} of \({\mathbf M}\). The basic theory is used to show that: (1) the alter egos that yield a finite-level duality form a principal filter of \({\mathcal A}_{\mathbf M}\) and, if any of these alter egos yield a duality, then they all do; (2) the alter egos that yield a finite-level strong duality form the top element of the lattice \({\mathcal A}_{\mathbf M}\); (3) the alter egos that yield a finite-level full duality form a complete sublattice \({\mathcal F}_{\mathbf M}\) of \({\mathcal A}_{\mathbf M}\), and those that yield a full duality form an increasing subset of \({\mathcal F}_{\mathbf M}\). The authors illustrate their results via several concrete examples. As the main tools they use a new Galois connection for partial operations as well as the concept of entailment. These results might be of an independent interest.
- 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
- 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)
