Lenke F, Urbat H, Milius S (2025)
Publication Language: English
Publication Type: Journal article
Publication year: 2025
Book Volume: 21
Journal Issue: 4
DOI: 10.46298/lmcs-21(4:4)2025
Extensions of Stone-type dualities have a long history in algebraic logic and have also been instrumental in proving results in algebraic language theory. We show how to extend abstract categorical dualities via monoidal adjunctions, subsuming various incarnations of classical extended Stone and Priestley duality as special cases, and providing the foundation for two new concrete dualities: First, we investigate residuation algebras, which are lattices with additional residual operators modeling language derivatives algebraically. We show that the subcategory of derivation algebras is dually equivalent to the category of profinite ordered monoids, restricting to a duality between Boolean residuation algebras and profinite monoids. We further refine this duality to capture relational morphisms of profinite ordered monoids, which dualize to natural morphisms of residuation algebras. Second, we apply the categorical extended duality to the discrete setting of sets and complete atomic Boolean algebras to obtain a concrete description for the dual of the category of all small categories.
APA:
Lenke, F., Urbat, H., & Milius, S. (2025). Extended Stone Duality via Monoidal Adjunctions. Logical Methods in Computer Science, 21(4). https://doi.org/10.46298/lmcs-21(4:4)2025
MLA:
Lenke, Fabian, Henning Urbat, and Stefan Milius. "Extended Stone Duality via Monoidal Adjunctions." Logical Methods in Computer Science 21.4 (2025).
BibTeX: Download