Kleene fixpoint theorem
From Wikipedia, the free encyclopedia
In mathematics, the Kleene fixpoint theorem of order theory states that given any complete lattice L, and any continuous (and therefore monotone) function
the least fixed point (lfp) of f is the least upper bound of the ascending Kleene chain of f, that is
obtained by iterating f on the bottom element of L. Expressed in a formula, the Kleene fixpoint theorem states that
where lfp denotes the least fixed point, lub denotes the least upper bound, and botL is the bottom element of L.
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
[edit] See also
- Other fixed-point theorems
