Paper: Logically Presented Domains (at LICS 1995)

Authors: Erik Palmgren Viggo Stoltenberg-Hansen

Abstract

In this paper we connect the theory of Scott-Ershov domains to first order model theory. The completeness property of domains is related to the model-theoretic notion of saturation. In constraint programming this analogy is already used on the level of finite approximations. A simple relation to structures used in nonstandard analysis is obtained. This leads to natural logical presentations of domain constructions such as function space, products and the Smyth power domain. Sufficient conditions on models for constructing function spaces are given.

BibTeX

  @InProceedings{PalmgrenStoltenberg-LogicallyPresentedD,
    author = 	 {Erik Palmgren and Viggo Stoltenberg-Hansen},
    title = 	 {Logically Presented Domains},
    booktitle =  {Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science (LICS 1995)},
    year =	 {1995},
    month =	 {June}, 
    pages =      {455--463},
    location =   {San Diego, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }