Mathematical theory of domains / Viggo Stoltenberg-Hansen, Ingrid Lindström, and Edward R. Griffor.
Material type:
TextSeries: Cambridge tracts in theoretical computer science ; 22Publisher: Cambridge ; New York : Cambridge University Press, 1994Description: xii, 349 pages : illustrations ; 26 cmContent type: - text
- unmediated
- volume
- 0521383447 (hardback)
- 511.3 20 S.V.M
- QA76.9.M35 S76 1994
Contents:
Preliminaries; Part I. Basic Theory: 1. Fixed points; 2. Complete partial orders; 3. Domains; 4. Domain equations; 5. Topology; 6. Representation theory; 7. A universal domain; Part II. Special Topics: 8. Representability in domains; 9. Basic recursion theory; 10. Effective domains; 11. Power domains; 12. Domains as models of formal theories; References; Index of symbols; Index.
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Books
|
Main library A8 | 511.3 S.V.M (Browse shelf(Opens below)) | Available | 00006203 |
Browsing Main library shelves, Shelving location: A8 Close shelf browser (Hides shelf browser)
| 511.3 J.R.D Discrete mathematics / | 511.3 L.W.M Mathematical logic : foundations for information science / | 511.3 R.E.A Automata, computability and complexity : theory and applications / | 511.3 S.V.M Mathematical theory of domains / | 511.32 C.N.F Finite ordered sets : concepts, results and uses / | 511.42 A.A.T A treatise on theory of errors and least squares adjustment for geomatic engineering students / | 511.5 E.S.G Graph algorithms / |
Includes bibliographical references (p. [332]-338) and indexes.
Preliminaries; Part I. Basic Theory: 1. Fixed points; 2. Complete partial orders; 3. Domains; 4. Domain equations; 5. Topology; 6. Representation theory; 7. A universal domain; Part II. Special Topics: 8. Representability in domains; 9. Basic recursion theory; 10. Effective domains; 11. Power domains; 12. Domains as models of formal theories; References; Index of symbols; Index.
There are no comments on this title.