We show, by a simple and direct proof, that if a bounded valuation on a directed complete partial order (dcpo) is the supremum of a directed family of simple valuations then it has a unique extension to a measure on the Borel-algebra of the dcpo with the Scott topology. It follows that every bounded and continuous valuation on a continuous domain can be extended uniquely to a Borel measure. The...

We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics for disjunctive logic programs, and pro...

With the unit interval [0,1] as the truth value table, Chen and Wupresented the concept of  possibility computation over dcpos.Indeed, every possibility computation can be considered as a[0,1]-valued Scott open set on a dcpo. The aim of this paper is tostudy Chen-Wu's duality on quantale-valued setting. For clarity,with a commutative unital quantale $L$ as the truth value table, weintroduce a c...

We introduce a new type of dcpo-completion of posets, called D-completion. For any poset P , the D-completion exists, and P and its Dcompletion have the isomorphic Scott closed set lattices. This completion is idempotent. A poset P is continuous (algebraic) if and only if its D-completion is continuous(algebraic). Using the D-completion, we construct the local dcpocompletion of posets, that rev...

Dcpos can be presented by a preorder of generators and inequational relations expressed as covers. Algebraic operations on the generators (possibly with their results being ideals of generators) can be extended to the dcpo presented, provided the covers are “stable” for the operations. The resulting dcpo algebra has a natural universal characterization and satisfies all the inequational laws sa...

the aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. all values aretaken in a fixed frame $l$. a definition of (strongly) completelydistributive $l$-ordered sets is introduced. the main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $l$-ordereds...

A dcpo P is continuous if and only if the lattice C(P ) of all Scottclosed subsets of P is completely distributive. However, in the case where P is a non-continuous dcpo, little is known about the order structure of C(P ). In this paper, we study the order-theoretic properties of C(P ) for general dcpo’s P . The main results are: (i) every C(P ) is C-continuous; (ii) a complete lattice L is iso...

Our interest is in automated termination proofs of higher-order rewrite rules in presence of dependent types modulo a theory T on base types. We first describe an original transformation to a type discipline without type dependencies which preserves non-termination. Since the user must reason on expressions of the transformed language, we then introduce an extension of the computability path or...

The canonical extension of a lattice is in an essential way a two-sided completion. Domain theory, on the contrary, is primarily concerned with one-sided completeness. In this paper, we show two things. Firstly, that the canonical extension of a lattice can be given an asymmetric description in two stages: a free co-directed meet completion, followed by a completion by selected directed joins. ...

The canonical extension of a lattice is in an essential way a two-sided completion. Domain theory, on the contrary, is primarily concerned with one-sided completeness. In this paper, we show two things. Firstly, that the canonical extension of a lattice can be given an asymmetric description in two stages: a free co-directed meet completion, followed by a completion by selected directed joins. ...