We introduce distributive unimodal logic as a modal logic of binary relations over posets which naturally generalizes the classical modal logic of binary relations over sets. The relational semantics of this logic is similar to the relational semantics of intuitionistic modal logic and positive modal logic, but it generalizes both of these by placing no restrictions on the accessibility relation.
We introduce a corresponding quasivariety of distributive lattices with modal operators and prove a completeness theorem which embeds each such algebra in the complex algebra of its canonical modal frame. We then extend this embedding to a duality theorem which unifies and generalizes the duality theorems for intuitionistic modal logic obtained by A.
Palmigiano and for positive modal logic obtained by S. Celani and A.
Jansana. As a corollary to this duality theorem, we obtain a Hennessy-Milner theorem for bi-intuitionistic unimodal logic, which is the expansion of distributive unimodal logic by bi-intuitionistic connectives.