2022/07/12 by Michal Botur, Botur, Michal, Jan Paseka +3
Computer Science · #Advanced Algebra and Logic #Rough Sets and Fuzzy Logic #Constraint Satisfaction and Optimization
paper · pdf · doi:10.48550/arxiv.2207.05453
Motivated by the classical work of Halmos on functional monadic Boolean algebras we derive three basic sup-semilattice constructions, among other things the so-called powersets and powerset operators. Such constructions are extremely useful and can be found in almost all branches of modern mathematics, including algebra, logic and topology. Our three constructions give rise to four covariant and two contravariant functors and constitute three adjoint situations we illustrate in simple examples.