Continuous Lattices and Domains

Authoritative and comprehensive account; an essential handbook for all those working in the area.

G. Gierz (Author), K. H. Hofmann (Author), K. Keimel (Author), J. D. Lawson (Author), M. Mislove (Author), D. S. Scott (Author)

9780521803380, Cambridge University Press

Hardback, published 6 March 2003

628 pages
23.6 x 16 x 3.8 cm, 0.957 kg

'… this is the book for all those interested in the topic … I am pleased to recommend … this most authentic source of information on continuous lattices and domains.' Acta Scientiarum Mathematicarum

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.

Preface
Acknowledgements
Foreword
Introduction
1. A primer on ordered sets and lattices
2. Order theory of domains
3. The Scott topology
4. The Lawson Topology
5. Morphisms and functors
6. Spectral theory of continuous lattices
7. Compact posets and semilattices
8. Topological algebra and lattice theory: Applications
Bibliography
List of symbols
List of categories
Index.

Subject Areas: Topology [PBP], Algebra [PBF]