Abstract

This paper presents a systematic study of coproducts. This is carried out principally, but not exclusively, for finitely generated quasivarieties $${{\bf \mathcal{A}}}$$ that admit a (term) reduct in the variety $${{\bf \mathfrak{D}}}$$ of bounded distributive lattices. In this setting, we present necessary and sufficient conditions on $${{\bf \mathcal{A}}}$$ for the forgetful functor $${U_{{\bf \mathcal{A}}}}$$ from $${{\bf \mathcal{A}}}$$ to $${{\bf \mathfrak{D}}}$$ to preserve coproducts. We also investigate the possible behaviours of $${U_{{\bf \mathcal{A}}}}$$ as regards coproducts in $${{\bf \mathcal{A}}}$$ under weaker assumptions. Depending on the properties exhibited by the functor, different procedures are then available for describing these coproducts. We classify a selection of well–known varieties within our scheme, thereby unifying earlier results and obtaining some new ones. The paper’s methodology draws heavily on duality theory. We use Priestley duality as a tool and our descriptions of coproducts are given in terms of this duality. We also exploit natural duality theory, specifically multisorted piggyback dualities, in our analysis of the behaviour of the forgetful functor into $${{\bf \mathfrak{D}}}$$ . In the opposite direction, we reveal that the type of natural duality that the class $${{\bf \mathcal{A}}}$$ can possess is governed by properties of coproducts in $${{\bf \mathcal{A}}}$$ and the way in which the classes $${{\bf \mathcal{A}}}$$ and $${U_{{\bf \mathcal{A}}}}$$ ( $${{\bf \mathcal{A}}}$$ ) interact.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.