3. Prove or give a counterexample to the following: For a set A and
binary relation R on A, if R is reflexive and symmetric, then R must
be transitive as well.
The answer to the question is available in the PDF file https://www.assignmentexpert.com/https://www.assignmentexpert.com/homework-answers/mathematics-answer-76224.pdf
Comments
Leave a comment