Revision as of 12:20, 18 February 2019 edit Loewenheim (talk \| contribs) 15 edits m Latex mistake ← Previous edit		Revision as of 19:18, 12 August 2019 edit undo Citation bot (talk \| contribs) Bots 5,868,144 edits m Removed URL that duplicated unique identifier. Removed parameters. \| You can use this bot yourself. Report bugs here.\| Activated by User:Headbomb Next edit →
Line 18: 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> == We first have to show that the ascending Kleene chain of <math>f</math> exists in <math>L</math>. To show that, we prove the following:

Kleene fixed-point theorem: Difference between revisions