最終更新日:2024/08/03
(mathematics) 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.
正解を見る
Knaster-Tarski theorem
編集履歴(0)
元となった辞書の項目
Knaster-Tarski theorem
name