Kleene fixed-point theorem: Difference between revisions

Content deleted Content added
m explain why Kleene's thm is different from Knaster-Tarski thm.
Added citation for proof
Line 17:
does not consider how fixed points can be computed by iterating ''f'' from some seed (also, it pertains to [[monotone function]]s on [[complete lattices]]).
 
== Proof<ref>{{Cite book|url=https://doi.org/10.1017/CBO9781139166386|title=Mathematical Theory of Domains by V. Stoltenberg-Hansen|last=Stoltenberg-Hansen|first=V.|last2=Lindstrom|first2=I.|last3=Griffor|first3=E. R.|publisher=Cambridge University Press|year=1994|isbn=0521383447|___location=|pages=24|language=en|doi=10.1017/cbo9781139166386|quote=|via=}}</ref> ==
== Proof ==
 
We first have to show that the ascending Kleene chain of ''f'' exists in L. To show that, we prove the following lemma: