## Domain Theory in Logical Form (1991)

### Cached

### Download Links

- [www.comlab.ox.ac.uk]
- [www.comlab.ox.ac.uk]
- [www.cs.ox.ac.uk]
- [web.comlab.ox.ac.uk]
- [web.comlab.ox.ac.uk]
- [www.cs.ox.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | Annals of Pure and Applied Logic |

Citations: | 230 - 10 self |

### BibTeX

@ARTICLE{Abramsky91domaintheory,

author = {Samson Abramsky},

title = {Domain Theory in Logical Form},

journal = {Annals of Pure and Applied Logic},

year = {1991},

volume = {51},

pages = {1--77}

}

### Years of Citing Articles

### OpenURL

### Abstract

The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of programs. Stone duality provides a junction between semantics (spaces of points = denotations of computational processes) and logics (lattices of properties of processes). Moreover, the underlying logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e. properties which can be determined to hold of a process on the basis of a finite amount of information about its execution. These ideas lead to the following programme: