Definition:Complete Lattice

From ProofWiki
Jump to: navigation, search

Definition

Let $\left({S, \preceq}\right)$ be a lattice.


Then $\left({S, \preceq}\right)$ is a complete lattice iff:

$\forall T \subseteq S: T$ admits both a supremum and an infimum.


Sources

Personal tools
Namespaces
Variants
Actions
Navigation
ProofWiki.org
ToDo
Toolbox
Google AdSense