Lattice theory has close connections with modal logic via algebraic semantics and lattices of modal logics. However, one less explored direction is to view lattices as relational structures based on partial orders, and study the modal logic over them. In this paper, following the earlier steps of Burgess and van Benthem in the 1980s, we use the basic tense logic and its nominal extensions with binary modalities of infimum and supremum to talk about lattices via standard Kripke semantics. As the main results, we obtain a series of complete axiomatizations of lattices, (un)bounded lattices over partial orders or strict preorders. In particular, we solve an axiomatization problem left open by Burgess (1984).
CITATION STYLE
Wang, X., & Wang, Y. (2022). Tense Logics over Lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13468 LNCS, pp. 70–87). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-15298-6_5
Mendeley helps you to discover research relevant for your work.