Continuous Lattices and Domains

Front Cover
Cambridge University Press, Mar 6, 2003 - Mathematics - 591 pages
0 Reviews
Information content and programming semantics are just two of the applications of the mathematical concepts of order, continuity and domains. The authors develop the mathematical foundations of partially ordered sets with completeness properties of various degrees, in particular directed complete ordered sets and complete lattices. Uniquely, they focus on partially ordered sets that have an extra order relation, modelling the notion that one element 'finitely approximates' another, something closely related to intrinsic topologies linking order and topology. Extensive use is made of topological ideas, both by defining useful topologies on the structures themselves and by developing close connections with numerous aspects of topology. The theory so developed not only has applications to computer science but also within mathematics to such areas as analysis, the spectral theory of algebras and the theory of computability. This authoritative, comprehensive account of the subject will be essential for all those working in the area.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

O4 Meet Continuous Lattices and Semilattices
36
The Scott Topology
131
I13 Inject ve Spaces
176
IH The Lawson Topology
208
Morphisms and Functors
264
Spectral Theory of Continuous Lattices
394
Compact Posets and Semilattices
439
Applications
492
Bibliography
523
Dissertations and Masters Theses
559
List of Symbols
568
Index
575
Copyright

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information