Abstract
This chapter is intended to give the reader a brief overview of some basic notations and theorems regarding fixed points of monotone functions on complete lattices. The main results stated and proved here are the Knaster-Tarski Theorem [175] (Theorem 20.4), and Theorem 20.12 on the characterization of simultaneous fixed points. That is, this chapter provides proofs and some additional insights to propositions introduced in Chapter 10.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fritz, C. (2002). Some Fixed Point Basics. In: Grädel, E., Thomas, W., Wilke, T. (eds) Automata Logics, and Infinite Games. Lecture Notes in Computer Science, vol 2500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36387-4_20
Download citation
DOI: https://doi.org/10.1007/3-540-36387-4_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00388-5
Online ISBN: 978-3-540-36387-3
eBook Packages: Springer Book Archive