A relational semantics for the logic of bounded lattices
This paper aims to propose a complete relational semantics for the so-called logic of bounded lattices, and prove a completeness theorem with regard to a class of two-sorted frames that is dually equivalent (categorically) to the variety of bounded lattices.