Abstract
A (meet-) semilattice is an algebra with one binary operation ∧, which is associative, commutative and idempotent. Throughout this paper we are working in the category of semilattices. All categorical or general algebraic notions are to be understood in this category . In every semilattice S the relation defines a partial ordering of S . The symbol "∨" denotes least upper bounds under this partial ordering. If it is not clear from the context in which partially ordered set a least upper bound is taken, we add this set as an index to the symbol; for example, ∨ A X denotes the least upper bound of X in the partially ordered set A .
Cite
CITATION STYLE
Bruns, G., & Lakser, H. (1970). Injective Hulls of Semilattices. Canadian Mathematical Bulletin, 13(1), 115–118. https://doi.org/10.4153/cmb-1970-023-6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.