Rough sets based on complete completely distributive lattice

2014 ◽  
Vol 269 ◽  
pp. 378-387 ◽  
Author(s):  
Ning Lin Zhou ◽  
Bao Qing Hu
1983 ◽  
Vol 26 (4) ◽  
pp. 446-453
Author(s):  
G. Gierz ◽  
J. D. Lawson ◽  
A. R. Stralka

AbstractA lattice is said to be essentially metrizable if it is an essential extension of a countable lattice. The main result of this paper is that for a completely distributive lattice the following conditions are equivalent: (1) the interval topology on L is metrizable, (2) L is essentially metrizable, (3) L has a doubly ordergenerating sublattice, (4) L is an essential extension of a countable chain.


1985 ◽  
Vol 32 (3) ◽  
pp. 361-374 ◽  
Author(s):  
Gerhard Gierz ◽  
Albert R. Stralka

The salient feature of the essential completion process is that for most common distributive lattices it will yield a completely distributive lattice. In this note it is shown that for those distributive lattices which have at least one completely distributive essential extension the essential completion is minimal among the completions by infinitely distributive lattices. Thus in its setting the essential completion of a distributive lattice behaves in much the some way as the one-point compactification of locally compact topological space does in its setting.


2020 ◽  
Vol 39 (3) ◽  
pp. 3907-3919
Author(s):  
Xiu-Yun Wu

On completely distributive lattice, the notion of fuzzy generalized convex space is introduced. It can be characterized by many means including fuzzy generalized hull space, fuzzy generalized restricted hull space, fuzzy generalized convexly enclosed relation space and fuzzy generalized derived hull space.


Sign in / Sign up

Export Citation Format

Share Document