Knaster-Tarski theorem (suomeksi)

Määritelmät:

(lb, en, math) A theorem stating that, if ''L'' is a complete lattice and ''f'' : ''L'' → ''L'' is an order-preserving function, then the set of fixed points of ''f'' in ''L'' is also a complete lattice. It has important applications in formal semantics of programming languages and abstract interpretation.