knaster-tarski theorem
Word Rarity
Very rare
Frequency: Zipf frequency 0.00 in modern English
33
Scrabble Score
20
Letters
5
Syllables
11
Unique Chars
Meaning
name
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.
Etymology
Inflected Forms
the Knaster-Tarski theorem (canonical)