Domain Theory, Logic and Computation 2003
DOI: 10.1007/978-94-017-1291-0_5
|View full text |Cite
|
Sign up to set email alerts
|

On Meet-Continuous Dcpos

Abstract: It is well-known that a complete lattice L is a meet-continuous lattice if and only ifThis property in fact can be characterized by the Scott topology simply as clσ(↓x ∩ ↓D) = ↓x whenever x ≤ W 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-ope… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 13 publications
0
9
0
Order By: Relevance
“…In this section, we show that a poset P is s 2 -continuous iff it is a meet s 2 -continuous and s 2 -quasicontinuous poset, generalizing the relevant characterization for dcpos (see [11,18]). [4,10].)…”
Section: Connections Between S 2 -Continuous Posets and S 2 -Quasiconmentioning
confidence: 98%
“…In this section, we show that a poset P is s 2 -continuous iff it is a meet s 2 -continuous and s 2 -quasicontinuous poset, generalizing the relevant characterization for dcpos (see [11,18]). [4,10].)…”
Section: Connections Between S 2 -Continuous Posets and S 2 -Quasiconmentioning
confidence: 98%
“…Every continuous dcpo is meet-continuous [12, Theorem III-2.11], meaning that if y ≤ sup D for any directed family D in Y , then y is in the Scott-closure of ↓ D ∩ ↓ y. (The theory of meet-continuous dcpos is due to Kou, Liu and Luo [26].) In the case at hand,…”
Section: The Baire Propertymentioning
confidence: 99%
“…Recall that a complete lattice L is called meet continuous if it satisfies the distributive law that binary meets distribute over directed joins. Kou, Liu and Luo extended the definition of meet continuity to general dcpos and presented a purely topological characterization (Kou et al 2003). A further generalization of meet continuity from dcpos to the setting of posets has been studied in the literature (Mao and Xu 2009).…”
Section: Introductionmentioning
confidence: 99%