Lattice in which every subset has supremum + infimum. Knaster-Tarski fixed-point: monotone f: L → L on complete lattice has fixed-point. Used in semantics of programming languages, abstract interpretation.
Lattice in which every subset has supremum + infimum. Knaster-Tarski fixed-point: monotone f: L → L on complete lattice has fixed-point. Used in semantics of programming languages, abstract interpretation.