Abstract
In this paper, we discuss the relationship between different types of reduction and set definability. We recall the definition of a decision reduct, a γ-decision reduct, a decision bireduct and a γ-decision bireduct in a Pawlak approximation space and the notion of set definability both in a Pawlak and a covering approximation space. We extend the notion of discernibility between objects in a Pawlak approximation space to a covering approximation space. Moreover, we introduce the definition of a decision reduct, a γ-decision reduct, a decision bireduct and a γ-decision bireduct in a covering approximation space. In addition, we study interrelationships between the four types of reduction, the correspondence with positive regions and the relationship to set definability in Pawlak and covering approximation spaces.
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.
