最終更新日：2025/11/29

Dictionary quizzes to help you remember vocabulary

Dictionary quizzes to help you remember vocabulary

(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

固有名詞

(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の定理：Lが完全格子であり、写像f: L → Lが順序を保つ場合、fの不動点全体が完全格子をなすという数学の定理。プログラミング言語の形式意味論や抽象解釈などへの応用がある。

このボタンはなに？

Graduate students often study the Knaster-Tarski theorem to understand how fixed points form complete lattices in denotational semantics.

Google翻訳 / DeepL翻訳

大学院生は、プログラミング言語の形式意味論や抽象解釈における不動点の扱いを理解するために、クナスター＝タルスキの定理をよく学ぶ。

意味（1）

(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.

ログイン / 新規登録

　

アプリをダウンロード！

DiQt（ディクト）

無料

★★★★★★★★★★