Knaster-Tarski theorem

proper noun

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.

Meanings

proper nounthe Knaster-Tarski theorem
  1. mathematicsA 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.

    Synonyms: Tarski's fixed-point theorem

Synonyms & antonyms

proper nounA 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.

Origin

Named after Bronisław Knaster and Alfred Tarski.

Full word history & related roots →
Cite this entry
APA

Knaster-Tarski theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Knaster-Tarski%20theorem

MLA

“Knaster-Tarski theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Knaster-Tarski%20theorem. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Knaster-Tarski theorem,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Knaster-Tarski%20theorem.

Source: Knaster-Tarski theorem on Wiktionary, CC BY-SA 4.0.