Continuous Lattices and Domains (Encyclopedia of Mathematics and its Applications, Series Number 93). Cet article n’est pas disponible.
Langue : anglais
Edité par Cambridge University Press, 2003
Série : Livre 81 sur 188 - Encyclopedia of Mathematics and its Applications
- Livre relié
- Neuf
Vendeur : Ria Christie Collections, Uxbridge, Royaume-UniRia Christie Collections
Vendeur avec une évaluation de 5 étoiles
Vendeur AbeBooks depuis 25 mars 2015
Indisponible
Livre relié
Etat: Neuf
EUR 318,55
A propos de cet article
In English.
N° de réf. du vendeur ria9780521803380_new
- Titre
- Continuous Lattices and Domains (Encyclopedia of Mathematics and its Applications, Series Number 93)
- Auteur
- Gierz, G.; Hofmann, K. H.; Keimel, K.; Lawson, J. D.; Mislove, M.; Scott, D. S.
- Éditeur
- Cambridge University Press
- Année de publication
- 2003
- État de l'article
- New
- Reliure
- Couverture rigide
- Langue
- anglais
- ISBN à 10 chiffres
- 0521803381
- ISBN à 13 chiffres
- 9780521803380
- Poids de l'article
- 1 216 grammes
- Série
- Livre 81 sur 188: Encyclopedia of Mathematics and its Applications
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.
« Synopsis » peut appartenir à une autre édition de cet ouvrage.
Présentation de l'éditeur
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.
« A propos de ce titre » peut appartenir à une autre édition de cet ouvrage.
Résultats de recherche pour Continuous Lattices and Domains (Encyclopedia of Mathematics and its Applications, Series Number 93)
Il reste 5 exemplaires de ce livre.Afficher tous les résultats