Abstract
This chapter is devoted to the introduction of the foundations of the denotational semantics of computer languages. The concepts of complete partial orders with bottom and of monotone and continuous functions are introduced and then the main fixpoint theorem is presented. The chapter is concluded by studying the immediate consequence operator, which is used to relate logical systems and fixpoint theory.
Good old Watson! You are the one fixed point in a changing age. (Sherlock Holmes)
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
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bruni, R., Montanari, U. (2017). Partial Orders and Fixpoints. In: Models of Computation. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-42900-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-42900-7_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42898-7
Online ISBN: 978-3-319-42900-7
eBook Packages: Computer ScienceComputer Science (R0)