Logically presented domains

Author

Palmgren, Erik ; Stoltenberg-Hansen, Viggo

Author_Institution

Dept. of Math., Uppsala Univ., Sweden

fYear

1995

fDate

26-29 Jun 1995

Firstpage

455

Lastpage

463

Abstract

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 (ultra powers, Frechet powers) 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

Keywords

constraint handling; formal languages; formal logic; set theory; Frechet powers; Scott-Ershov domains; Smyth power domain; completeness property; constraint programming; domain constructions; finite approximations; first order model theory; function space; function spaces; logically presented domains; model theoretic notion; natural logical presentations; nonstandard analysis; saturation; sufficient conditions; ultra powers; Algebra; Constraint theory; Logic programming; Mathematical programming; Sufficient conditions;

fLanguage

English

Publisher

ieee

Conference_Titel

Logic in Computer Science, 1995. LICS '95. Proceedings., Tenth Annual IEEE Symposium on

Conference_Location

San Diego, CA

ISSN

1043-6871

Print_ISBN

0-8186-7050-9

Type

conf

DOI

10.1109/LICS.1995.523279

Filename

523279