Properties and Characterizations of Countably C-approximating Posets
Journal of Advances in Mathematics and Computer Science · pp. 719–727 · Published 9 Dec 2014
10.9734/BJMCS/2015/14394Abstract
In this paper, the concept of countably C-approximating posets is introduced. Properties and characterizations of countably C-approximating posets are presented. Main results are: (1) the lattice of all σ-Scott-closed subsets for any poset is countably C-approximating; (2) a complete lattice is completely distributive iff it is countably approximating and countably C-approximating.
Cited by 1
Xu-Xin Mao, Luo-Shan Xu · TheScientificWorldJournal · 2014
Related research
- A Note on Quasicontinuous Domains — shares topic coverage
Article metrics
Real usage data collected on this platform.
6
Page views
0
PDF downloads
9
Outbound clicks
1
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.