Word.ws English Dictionary

Knaster-Tarski theorem

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.

Proper noun

the Knaster-Tarski theorem

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

Synonyms of Knaster-Tarski theorem

Origin of Knaster-Tarski theorem

Named after Bronisław Knaster and Alfred Tarski.

Questions about Knaster-Tarski theorem

What does Knaster-Tarski theorem mean?
Knaster-Tarski theorem means 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.
What part of speech is Knaster-Tarski theorem?
Knaster-Tarski theorem is a proper noun.

Words near Knaster-Tarski theorem in the dictionary

  1. knarry
  2. knars
  3. Knarsdale
  4. knasibfite
  5. knaster
  6. Knaster-Tarski theorem
  7. knat
  8. Knaub
  9. Knaubs
  10. knaue
  11. Knauer

Source and license

Adapted from Wiktionary: Knaster-Tarski theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Knaster-Tarski theorem.” Word.ws, https://word.ws/knaster-tarski_theorem. Based on Wiktionary, CC BY-SA 4.0.