Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice
Author
Source
Mathematical Problems in Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-11, 11 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-09-26
Country of Publication
Egypt
No. of Pages
11
Main Subjects
Abstract EN
The concept of soft sets based on complete atomic Boolean lattice, which can be seen as a generalization of soft sets, is introduced.
Some operations on these soft sets are discussed, and new types of soft sets such as full, keeping infimum, and keeping supremum are defined and supported by some illustrative examples.
Two pairs of new soft rough approximation operators are proposed and the relationship among soft set is investigated, and their related properties are given.
We show that Järvinen's approximations can be viewed as a special case of our approximation.
If B=℘(U), then our soft approximations coincide with crisp soft rough approximations (Feng et al.
2011).
American Psychological Association (APA)
Mustafa, Heba I.. 2013. Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice. Mathematical Problems in Engineering،Vol. 2013, no. 2013, pp.1-11.
https://search.emarefa.net/detail/BIM-1009540
Modern Language Association (MLA)
Mustafa, Heba I.. Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice. Mathematical Problems in Engineering No. 2013 (2013), pp.1-11.
https://search.emarefa.net/detail/BIM-1009540
American Medical Association (AMA)
Mustafa, Heba I.. Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice. Mathematical Problems in Engineering. 2013. Vol. 2013, no. 2013, pp.1-11.
https://search.emarefa.net/detail/BIM-1009540
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1009540