Abstract
In this paper, we have examine some properties of elements of the semigroup , where DX, is the set of all binary relations α ⊆ X × X satisfying , (), and is a binary operation on DX defined by () , with xα denoting set of images of x under α, and yβ−1 denoting set of pre-images of y under β. In particular, we showed that in the semigroup there is no distinction between the concepts of reflexive and symmetric relations. We also presented a characterization of idempotent elements in in term of equivalence relations.
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.
