Abstract
In this paper, we investigate Pawlak’s rough set theory from a categorical point of view, by introducing specific categories of lower and upper operators in order to analyze in a generalized setting the usual approximant operators of rough set theory. We determine several embeddings and isomorphisms between these categories and suitable categories of finitary matroids, set partitions and equivalence relations, some of which already investigated in recent papers. Using the aforementioned isomorphic categories, we exhibit several categorical properties of lower and upper operators. In addition, as one of the main applications of rough set theory concerns Pawlak’s information systems and Granular Computing, in the last part of the paper we translate in categorical terms the occurrence of rough sets in Granular Computing and, to this end, we need to work with a category PR of pairings (i.e. generalizations of Pawlak’s information systems) and pairing homomorphisms. More specifically, we exhibit several categorical properties of pairings, such as balancedness, completeness, exactness, (RegEpi,Mono-Source)-factorizability and prove that PR is Heyting but, in general, it does not admit coproducts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
