Soft rough approximation operators on a complete atomic Boolean lattice (Q459998)

Summary: 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=\mathfrak p(U)\), then our soft approximations coincide with crisp soft rough approximations [\textit{F. Feng} et al., Inf. Sci. 181, No. 6, 1125--1137 (2011; Zbl 1211.68436)].