Definitions from Wiktionary (Knaster-Tarski theorem)
▸ noun: (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.
▸ Words similar to Knaster-Tarski theorem
▸ Usage examples for Knaster-Tarski theorem
▸ Idioms related to Knaster-Tarski theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near Knaster-Tarski theorem
▸ Rhymes of Knaster-Tarski theorem
▸ Invented words related to Knaster-Tarski theorem
▸ noun: (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.
Similar:
Tarski's fixed-point theorem,
Tarski-Seidenberg theorem,
Lefschetz fixed-point theorem,
lattice theory,
Tarski-Kuratowski algorithm,
Kleene fixed-point theorem,
Banach-Tarski paradox,
Kleene's fixed-point theorem,
Tamari lattice,
bounded lattice,
more...
▸ Words similar to Knaster-Tarski theorem
▸ Usage examples for Knaster-Tarski theorem
▸ Idioms related to Knaster-Tarski theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near Knaster-Tarski theorem
▸ Rhymes of Knaster-Tarski theorem
▸ Invented words related to Knaster-Tarski theorem