Finite axiomatization of languages for representation of system properties: Axiomatization of dependencies

Abstract

The existence of full, consistent, and finite systems of inference rules for several languages is discussed. These languages are used for the description of system classes, the system being given by a multiplace relation. The same languages—types of dependencies—are used in relational database theory for describing integrity constraints. The absence of finite axiomatization for different types of dependencies, including join dependencies, is proved.