Logical presentations of domains

This thesis combines a fairly general overview of domain theory with a detailed examination of recent work which establishes a connection between domain theory and logic. To start with, the theory of domains is developed with such issues as the semantics of recursion and iteration; the solution of recursive domain equations; and non-determinism in mind. In this way, a reasonably comprehensive account of domains, as ordered sets, is given. The topological dimension of domain theory is then revealed, and the logical insights gained by regarding domains as topological spaces are emphasised. These logical insights are further reinforced by an examination of pointless topology and Stone duality. A few of the more prominent categories of domains are surveyed, and Stone-type dualities for the objects of some of these categories are presented. The above dualities are then applied to the task of presenting domains as logical theories. Two types of logical theory are considered, namely axiomatic systems, and Gentzen-style deductive systems. The way in which these theories describe domains is by capturing the relationships between the open subsets of domains.

Grantor dc:publisher.institution

Department of Mathematics and Applied Mathematics

Year dc:date.issued

1993

Author dc:creator

• Hulley, Hardy

Advisor dc:contributor.advisor

• Brink, Chris

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/11427/17336

OAI identifier oai:identifier

oai:open.uct.ac.za:11427/17336