On the Completion of Rough Sets System Determined by Arbitrary Binary Relations

Article type: Research Article

Authors: Umadevi, Dwaraganathan

Affiliations: Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar - 626 001, Tamil Nadu, India. [email protected]

Note: [] Address for correspondence: Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar - 626 001, Tamil Nadu, India

Abstract: 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.

Keywords: Poset, complete lattice, completion of a poset, rough sets

DOI: 10.3233/FI-2015-1188

Journal: Fundamenta Informaticae, vol. 137, no. 3, pp. 413-424, 2015