Continuous Lattices and Domains

Collectif d'auteurs

590 pages, parution le 17/03/2003

Ajouter à une liste

Indisponible

Résumé

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.

Contents

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;

L'auteur - Collectif d'auteurs

Autres livres de Collectif d'auteurs

Daniel Buren, mot à mot

Familles. Permanence et métamorphoses

Architecture studio

Structuration et management des organisations

Découvrir tous les livres de Collectif d'auteurs

Caractéristiques techniques

	PAPIER
Éditeur(s)	Cambridge University Press
Auteur(s)	Collectif d'auteurs
Parution	17/03/2003
Nb. de pages	590
Format	16 x 23,5
Couverture	Relié
Poids	950g
Intérieur	Noir et Blanc
EAN13	9780521803380
ISBN13	978-0-521-80338-0