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
then 1. The least fixed point (lfp) of f is the least upper bound of the ascending Kleene chain of f, that is
denotes the least fixed point, Failed to parse (Missing texvc executable; please see math/README to configure.): \textrm{lub}
denotes the least upper bound, and Failed to parse (Missing texvc executable; please see math/README to configure.): \textrm{bot}_L
is the bottom element of Failed to parse (Missing texvc executable; please see math/README to configure.): L
. 2. The greatest fixed point (gfp) of f is the greatest lower bound of the descending Kleene chain of f, that is
denotes the greatest fixed point, Failed to parse (Missing texvc executable; please see math/README to configure.): \textrm{glb}
denotes the greatest lower bound, and Failed to parse (Missing texvc executable; please see math/README to configure.): \textrm{top}_L
is the top element of Failed to parse (Missing texvc executable; please see math/README to configure.): L
. See also
|


