14,032 views
43 votes
43 votes

Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$?

  1. $\neg \exists t \in r \left(P\left(t\right)\right)$
  2. $\exists t \notin r \left(P\left(t\right)\right)$
  3. $\neg \exists t \in r \left(\neg P\left(t\right)\right)$
  4. $\exists t \notin r \left(\neg P\left(t\right)\right)$
    1. I only
    2. II only
    3. III only
    4. III and IV only

5 Answers

–1 votes
–1 votes

∃t∈r(⌝ P(t))--means that there are some tuples in relation r which do not satisfy the constraint P(t)

and if we put not before this statement we get there are no tuples in relation r which do not satisfy the constraint P(t) which is equivalent to saying all tuples in relation r satify predicate condition P(t)

Answer:

Related questions

50 votes
50 votes
6 answers
4
Kathleen asked Sep 12, 2014
21,773 views
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place?$3$$4$$5$$6$