C-unique Dcpos and Non-maximality of the Class of Dominated Dcpos Regarding Γ-faithfulness | Zendy

Luoshan Xu | Zendy; Dongsheng Zhao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

C-unique Dcpos and Non-maximality of the Class of Dominated Dcpos Regarding Γ-faithfulness

Author(s) -

Luoshan Xu,

Dongsheng Zhao

Publication year - 2019

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2019.07.027

Subject(s) - mathematics , class (philosophy) , pure mathematics , set (abstract data type) , space (punctuation) , topological space , discrete mathematics , computer science , artificial intelligence , programming language , operating system

We continue the study of the dcpos which are determined by their Scott closed set lattices. Such dcpos are called C σ -unique. Some new sufficient conditions for a dcpo to be C σ -unique are given. One example is constructed to show that a C σ -unique dcpo need not be dominated. Thus the question whether the dominated dcpos form a maximal Γ-faithful class of dcpos is negatively answered. Using a recent result by Zhao and Xi, we also deduce that every T 1 topological space has a dcpo model that is C σ -unique.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research