Recursively defined domains and their induction principles (Q1098615)

Amo\(\{\) \(A_ 1,...,A_{\ell}\}\) is the set of minimal keys over \(\Omega\) and \(K^{-1}=\{B_ 1,...,B_ m\}\) is the set of all antikeys of K, then \(\cup^{\ell}_{i=1}A_ i=\Omega \setminus \cap^{m}_{i=1}B_ i\), i.e. \(\Omega\setminus \cap^{m}_{i=1}B_ i\) is the set of all prime attributes. Based on this result we are going to construct an algorithm that decides from a given relation R whether an arbitrary attribute is or isn't prime. We prove that worst-case time of our algorithm is polynomial in the number of rows and columns of R. In this paper we give the representation of a minimal key through a set of antikeys.