Completeness in Semi-Lattices
L. E. Ward · Canadian Journal of Mathematics · 1957
Let (X, ≤) be a partially ordered set, that is, X is a set and ≤ is a reflexive, anti-symmetric, transitive, binary relation on X. We write , for each x ∈ X. If, moreover, exists for each x and y in X, then (X, ≤) is said to be a semi-lattice.