Knaster-Tarski theorem

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

Named after Bronisław Knaster and Alfred Tarski.

Proper noun[edit]

the Knaster-Tarski theorem

  1. (mathematics) A theorem stating that, if L is a complete lattice and f : LL 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.
    Synonym: Tarski's fixed-point theorem