Knaster-Tarski theorem
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after Bronisław Knaster and Alfred Tarski.
Proper noun[edit]
- (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.
- Synonym: Tarski's fixed-point theorem