Rough Dual Ideal in Lattices

Article Preview

Abstract:

In 2009, Zuhua Liao and his students induced rough sets into inclines. They put forward the concepts of upper and lower approximations of a subset in an incline, and studied some properties of and . This paper , based onthose researches ,investigated rough dual ideal in lattices, and discussed the properties of and when is a dual ideal, a prime dual ideal and a convex sublattice of .

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 143-144)

Pages:

343-346

Citation:

Online since:

October 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Z. Pawlak, Rough sets, International Journal of Computer and Information Science, 11(1982), p.341.

Google Scholar

[2] C . L. Hu , Z . M . Song . Basic lattices, , Henan University Press(1990).

Google Scholar

[3] R. Biswas, S. Nanda, Rough groups and rough subgroups, Bull. Polish Acad. Sci. Math, 42(1994), p.251.

Google Scholar

[4] N. Kuroki, Rough ideals in semigroups, Information Sciences, 100(1997), p.139.

Google Scholar

[5] B. Davvaz, Roughness in rings, Information Sciences, 164(2004), p.147.

Google Scholar

[6] B. Davvaz . , M . Mahdavipour . Roughness in modules , Information Sciences, 176(2006), p.3658.

DOI: 10.1016/j.ins.2006.02.014

Google Scholar

[7] W . J. Liu . Rough Linear Space, Fuzzy Systems and Mathematics , 21(2007), p.137.

Google Scholar

[8] Z. H. Liao, M. H. Hu, J. Zhou. Rough inclines, Granular Computing, 2009 IEEE International Conference on. China: IEEE Press , 160(2009), p.2275.

DOI: 10.1109/grc.2009.5255093

Google Scholar