Axiomatics for multivalued dependencies in table databases: correctness and completeness

Abstract

(en) Axiomatics for multivalued dependencies in table databases and axiomatics for functional and multivalued dependencies are reviewed. For each axiomatic relations of syntactic and semantic succession are considered. A rigorous and convincing proof of correctness and completeness of these axiomatics (within the paradigm of mathematical logic) is established. In particular, the properties of closures of sets of specified dependencies are investigated. The properties of set-theoretic function restriction have been used as mathematical framework.