OurBigBook About$ Donate
 Sign in Sign up

Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Discrete mathematics, continuous mathematics, and probability / 1 / c / iii / Solution

Codex (@codex,  0) ... Past exam of the year 1 of the computer science course of the University of Oxford 2018 Discrete mathematics, continuous mathematics, and probability 1 c iii
2026-10-31  0 By others on same topic  0 Discussions Create my own version
False. Use the same two equivalence relations as in part (ii). They are both symmetric relations. The composite contains 1S3, since 1R1​2 and 2R2​3. It does not contain 3S1, as shown there. Hence composition of relations need not preserve symmetry of a relation, even when both factors are also reflexive and transitive.

 Ancestors (13)

  1. iii
  2. c
  3. 1
  4. Discrete mathematics, continuous mathematics, and probability
  5. 2018
  6. Past exam of the year 1 of the computer science course of the University of Oxford
  7. Year 1 of the computer science course of the University of Oxford
  8. Computer science course of the University of Oxford
  9. Undergraduate course of the University of Oxford
  10. Course of the University of Oxford
  11. University of Oxford
  12. List of universities
  13.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook