Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics, and probability / Discrete mathematics / 3 / a

Table of contents
- i a
  - Solution i
- ii a
  - Solution ii
- iii a
  - Solution iii
- iv a
  - Solution iv
- v a
  - Solution v

i

Solution

A binary relation

R

on

A

is a reflexive relation precisely when $a R a$ for every $a \in A$ .

ii

Solution

A binary relation

R

on

A

is a symmetric relation precisely when $a R b \Rightarrow b R a$ for all $a, b \in A$ .

iii

Solution

A binary relation

R

on

A

is an antisymmetric relation precisely when $(a R b and b R a) \Rightarrow a = b$ for all $a, b \in A$ .

iv

Solution

A binary relation

R

on

A

is a transitive relation precisely when $(a R b and b R c) \Rightarrow a R c$ for all $a, b, c \in A$ .

v

Solution

A binary relation is an equivalence relation precisely when it is reflexive, symmetric, and transitive.

 Ancestors (12)

 View article source

 Discussion (0)

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