Completeness of armstrong's axiomatic

Abstract

(en) This paper presents a rigorous and convincing proof that Armstrong’s axiomatic system (as the foundation of relational database normalization theory) is complete and sound within the paradigm of mathematical logic: the relations of syntactic and semantic entailment are introduced and it is shown that they coincide. The properties of set-theoretic data structure functional constraints have been used as mathematical framework.