Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice

Heba I. Mustafa

Mathematical Problems in Engineering, 2013, vol. 2013, 1-11

Abstract:

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 , then our soft approximations coincide with crisp soft rough approximations (Feng et al. 2011).

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/486321.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/486321.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:486321

DOI: 10.1155/2013/486321

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().