Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T00:46:49.332Z Has data issue: false hasContentIssue false

Completeness in Semi-Lattices

Published online by Cambridge University Press:  20 November 2018

L. E. Ward Jr.*
Affiliation:
U.S. Naval Ordnance Test Station China Lake, California
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1957