Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6876035 | Theoretical Computer Science | 2015 | 8 Pages |
Abstract
To prove this, we reduce the notion of meet-continuity for dcpos to one which only involves well-ordered chains. This allows us to characterise meet-continuity by “forbidden substructures”. We then show that each forbidden substructure has a non-quasicontinuous function space.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Xiaodong Jia, Achim Jung, Hui Kou, Qingguo Li, Haoran Zhao,