On the Completion of Rough Sets System Determined by Arbitrary Binary Relations
Dwaraganathan Umadevi · Fundamenta Informaticae · 2015
In this paper, a solution is given to the problem proposed by Järvinen in [8]. A smallest completion of the rough sets system determined by an arbitrary binary relation is given. This completion, in the case of a quasi order, coincides with the rough sets system which is a Nelson algebra. Further, the algebraic properties of this completion has been studied.