Another look on tense and related operators (Q2099808): Difference between revisions

Building on the category \(\mathbb{S}\) of sup-semilattices (complete lattices) and sup-preserving maps (maps preserving arbitrary joins), the authors consider three basic constructions, which find their use in various branches of modern mathematics (including algebra, logic, and topology). More precisely, the authors construct: (1) a sup-semilattice \(L^J\) equipped with a unary operation \(F\) (called an \textit{\(F\)-sup-semilattice}) from a sup-semilattice \(L\) and a frame \(J\), where a \textit{frame} \(J\) is a pair \((T,S)\), which consists of a set \(T\) and a binary relation \(S\); (2) a sup-semilattice \(J\otimes H\) from a frame \(J\) and an \(F\)-sup-semilattice \(H\); and (3) a frame \(J[H,L]\) from an \(F\)-sup-semilattice \(H\) and a sup-semilattice \(L\). These constructions give rise to four covariant and two contravariant functors between certain categories. In particular, one arrives at the backward powerset operator of, e.g., [\textit{L. A. Zadeh}, Inf. Control 8, 338--353 (1965; Zbl 0139.24606)] and tense operators of, e.g., [\textit{I. Chajda} and \textit{J. Paseka}, Algebraic approach to tense operators. Lemgo: Heldermann Verlag (2015; Zbl 1350.03002)] as a particular case of the above constructions. Moreover, the obtained results provide a unifying view on recent achievements in representations of tense operators in various categories of partially ordered sets and lattices. While considering representations and approximations of sup-semilattices with unary operations, the authors take their motivation in the book of \textit{P. R. Halmos} on functional monadic Boolean algebras [Algebraic logic. New York: Chelsea Publishing Company (1962; Zbl 0101.01101)]. The paper is well written, gives most of its required preliminaries (the omitted ones can be found in the list of references at the end of the paper), and will be of interest to the researchers studying applications of the theory of sup-lattices.