2 problems

Let $\mathbf D(R)$ be a strongly first order dependency. A dependency is non-jumping when it has the non-jumping property considered in the paper. Decomposition conjecture. Every s…

Let $\mathbf D$ be a generalized dependency. It is relativizable if every sentence of $\texttt{FO}(\mathbf D^{(P)})$ is equivalent to some sentence of $\texttt{FO}(\mathbf D)$. Rel…