Article ID Journal Published Year Pages File Type
437668 Theoretical Computer Science 2010 7 Pages PDF
Abstract

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 D-completion 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 dcpo-completion of posets, that revises the one given by Mislove. In the last section, we define and study bounded sober spaces.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics