edited by
1,660 views
0 votes
0 votes

The relation $\leq$ and $>$ on a boolean algebra are defined as:

$x \leq y$ if and only if $x \vee y =y$

$x <y$ means $x \leq y$ but $x \neq y$

$x \geq y$ means $y \leq x$ and

$x>y$ means $y<x$

Considering the above definitions, which of the following is not true in the boolean algebra?

  1. If $x \leq y$ and $y \leq z$, then $x \leq z$
  2. If $x \leq y$ and $y \leq x$, then $x = y$
  3. If $x < y$ and $y < z$, then $x \leq y$
  4. If $x < y$ and $y <  z$, then $x < y$

Choose the correct answer from the code given below:

  1. i and ii only
  2. ii and iii only
  3. iii only
  4. iv only
edited by

1 Answer

Related questions

1 votes
1 votes
0 answers
2
0 votes
0 votes
2 answers
3
Arjun asked Jan 2, 2019
4,377 views
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$