Representation Theorems for Terms in a Certain Model for Information Systems

We study a term-language, which is used by the “Warsaw-School” in an abstract model for information systems. Various normal forms as well as standard expansions with respect to product terms are formulated and proved correct. It is shown that the shortest sums of so-called maximal sub-products are the shortest representations of terms and algorithms for their generation are given.