On Meet-Continuous Dcpos

It is well-known that a complete lattice L is a meet-continuous lattice if and only if \(x \wedge \vee D = { \vee _{d \in D}}x \wedge d\) for all x ∈ P. This property in fact can be characterized by the Scott topology simply as clσ (↓x ∩ ↓D) = ↓x whenever x ≤ ∨ D. Since the meet operator is not involved, the topological property of meet-continuity can be naturally extended to general dcpos. Such dcpos are also called meet-continuous in this note. It turns out that there exist close relations among meet-continuity, Hausdorff separation, quasicontinuity, continuity and Scott-open filter bases. In particular, we prove that Hausdorff dcpos (via the Lawson topology) need not be quasicontinuous, the category CONT is not a reflective full subcategory of QCONT, the category of quasicontinuous domains, and a dcpo P is meet-continuous when \(\sigma (P) = \overline \sigma (P)\) or it is a semilattice with a \({T_0}\overline \sigma (D)\)-topology, where \(\overline \sigma (P)\) denote the topology generated by all the Scott-open filters of P. Moreover, under appropriate conditions, the category of dcpos with \({T_0}\overline \sigma (D)\)-topology form a cartesian closed category.

[1]  Reinhold Heckmann,et al.  Power Domain Constructions , 1991, Sci. Comput. Program..

[2]  Compact continuous L-domains , 1999 .

[3]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .

[4]  Carl A. Gunter Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

[5]  Michael W. Mislove,et al.  Topology, domain theory and theoretical computer science , 1998 .

[6]  Glynn Winskel,et al.  Using Information Systems to Solve Recursive Domain Equations Effectively , 1984, Semantics of Data Types.

[7]  Reinhold Heckmann,et al.  An Upper Power Domain Construction in Terms of Strongly Compact Sets , 1991, MFPS.

[8]  J. van Mill,et al.  Open Problems in Topology , 1990 .

[9]  K. Hofmann,et al.  A Compendium of Continuous Lattices , 1980 .

[10]  Jimmie D. Lawson The Versatile Continuous Order , 1987, MFPS.

[11]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[12]  A. Jung,et al.  Cartesian closed categories of domains , 1989 .

[13]  Roberto M. Amadio,et al.  Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.

[14]  Jimmie D. Lawson,et al.  The Upper Interval Topology, Property M and Compactness , 1997, COMPROX.

[15]  John R. Isbell,et al.  Function spaces and adjoints. , 1975 .

[16]  Jan Paseka,et al.  A direct proof of the Hofmann-Mislove theorem , 1994 .

[17]  Horst Herrlich,et al.  Category theory , 1979 .

[18]  Achim Jung,et al.  The classification of continuous domains , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[19]  M. Smyth Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.