A Fuzzy Lower Powerdomain
نویسنده
چکیده
The power set of a domain D can be seen as the function space D ! 2 of all functions in the pointwise order. One computational version thereof is the lifted lower powerdomain, which we can think of as the lattice of Scott-closed subsets or, alternatively, as the order dual of the function space D ! 2]. Therefore, logic and the ordinary power set, as well as its information-theoretic version, rest upon 2. If we replace 2 by the unit interval I then the order dual of D ! I] gives rise to the fuzzy lower power domain F D]. On maps g 2 D ! E] the function F g] is the upper adjoint of g ! id I ]. In this way F ] is a locally continuous functor from DCPO to distributive complete lattices and maps preserving suprema. If D is an L-domain then F D] is a distributive co-continuous lattice. If D is an FS-domain then F D] is completely distributive; in particular, U F ] is a locally continuous endofunctor on FS where U is the obvious forgetful functor.
منابع مشابه
An elementary proof that upper and lower powerdomain constructions commute
It was proved in [1] that lower and upper powerdomain constructions commute on all domains. In that proof, domains were represented as information systems. In [2] a rather complicated algebraic proof was given which relied on universality properties of powerdomains proved in the previous works of the author of [2]. Here we give an elementary algebraic proof that upper and lower powerdomain cons...
متن کاملA Note on the Smyth Powerdomain Construction
Powerdomains are the order-theoretic analogue of powersets and are used to model non-determinism and concurrency [9, 8, 3, 10]. There exist three standard kinds of order-theoretic powerdomain: the Plotkin, Smyth and Hoare powerdomain. To obtain a powerdomain from a given !-algebraic cpo D, one constructs the collection F(D) of finite, non-empty sets of finite elements from D (for necessary defi...
متن کاملThe Mixed Powerdomain
This paper characterizes the powerdomain constructions which have been used in the semantics of programming languages in terms of formulas of first order logic under a preordering of provable implication. The goal is to reveal the basic logical significance of the powerdomain elements by casting them in the right setting. Such a treatment may contribute to a better understanding of their potent...
متن کاملCategorical Domain Theory: Scott Topology, Powercategories, Coherent Categories
In the present article we continue recent work in the direction of domain theory were certain (accessible) categories are used as generalized domains. We discuss the possibility of using certain presheaf toposes as generalizations of the Scott topology at this level. We show that the toposes associated with Scott complete categories are injective with respect to dense inclusions of toposes. We ...
متن کاملThe Powerdomain of Indexed Valuations
This paper is about combining nondeterminism and probabilities. We study this phenomenon from a domain theoretic point of view. In domain theory, nondeterminism is modeled using the notion of powerdomain, while probability is modeled using the powerdomain of valuations. Those two functors do not combine well, as they are. We define the notion of powerdomain of indexed valuations, which can be c...
متن کامل