Abstract
In this paper we introduce SFP M , a category of SFP domains which provides very satisfactory domain-models, i.e. “partializations”, of separable Stone spaces (2- Stone spaces). More specifically, SFP M is a subcategory of SFP ep , closed under direct limits as well as many constructors, such as lifting, sum, product and Plotkin powerdomain (with the notable exception of the function space constructor). SFP M is “structurally well behaved”, in the sense that the functor MAX , which associates to each object of SFP M the Stone space of its maximal elements, is compositional with respect to the constructors above, and ω-continuous. A correspondence can be established between these constructors over SFP M and appropriate constructors on Stone spaces, whereby SFP M domain-models of Stone spaces defined as solutions of a vast class of recursive equations in SFP M , can be obtained simply by solving the corresponding equations in SFP M . Moreover any continuous function between two 2-Stone spaces can be extended to a continuous function between any two SFP M domain-models of the original spaces. The category SFP M does not include all the SFP's with a 2-Stone space of maximal elements (CSFP's). We show that the CSFP's can be characterized precisely as suitable retracts of SFP M objects. Then the results proved for SFP M easily extends to the wider category having CSFP's as objects. Using SFP M we can provide a plethora of “partializations” of the space of finitary hypersets (the hyperuniverse N ω (Ann. New York Acad. Sci. 806 (1996) 140). These includes the classical ones proposed in Abramsky (A Cook's tour of the finitary non-well-founded sets unpublished manuscript, 1988; Inform. Comput. 92(2) (1991) 161) and Mislove et al. (Inform. Comput. 93(1) (1991) 16), which are also shown to be non-isomorphic, thus providing a negative answer to a problem raised in Mislove et al.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.