Name
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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/LICS.1995.523279 | LICS |
Keywords | Field | DocType |
completeness property,function space,finite approximation,order model theory,smyth power domain,logically presented domains,constraint programming,domain construction,natural logical presentation,model-theoretic notion,scott-ershov domain,formal logic,set theory,nonstandard analysis,model theory,algebra,formal languages,mathematical programming,first order,function spaces,logic programming,saturation | Set theory,Discrete mathematics,Function space,Combinatorics,Power domains,Computer science,Constraint programming,Domain theory,Logic programming,Model theory,Least-upper-bound property | Conference |
ISSN | ISBN | Citations |
1043-6871 | 0-8186-7050-6 | 0 |
PageRank | References | Authors |
0.34 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik Palmgren | 1 | 233 | 43.17 |
| Viggo Stoltenberg-hansen | 2 | 110 | 18.25 |