Fabian Lenke ; Henning Urbat ; Stefan Milius - Extended Stone Duality via Monoidal Adjunctions

lmcs:15916 - Logical Methods in Computer Science, October 8, 2025, Volume 21, Issue 4 - https://doi.org/10.46298/lmcs-21(4:4)2025
Extended Stone Duality via Monoidal AdjunctionsArticle

Authors: Fabian Lenke ; Henning Urbat ; Stefan Milius

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.


Volume: Volume 21, Issue 4
Secondary volumes: Selected Papers of the 27th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2024)
Published on: October 8, 2025
Accepted on: June 23, 2025
Submitted on: June 23, 2025
Keywords: Formal Languages and Automata Theory

Consultation statistics

This page has been seen 863 times.
This article's PDF has been downloaded 444 times.