2000 character limit reached
Fuzzy Rough Relations (1109.1803v1)
Published 6 Sep 2011 in math.GM
Abstract: In this paper, the definition of fuzzy rough relation on a set will be introduced and then it would be proved that the collection of such relations is closed under different binary compositions such as, algebraic sum, algebraic product etc. Also the definitions of reflexive, symmetric and transitive fuzzy rough relations on a set are given and a few properties of them will be investigated. Lastly, we define a operation, which is a composition of two fuzzy rough relations, with the help of maxmin relation and thereafter it is shown that the collection of such relations is closed under the operation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
