Generalization of the Classical Result of Codd-Lacroix-Pirotte

Abstract: The paper is focused on some theoretical questions of the Database Theory. The result which concerns equivalence of table algebra for infinite tables and corresponding relational calculi is presented. This result generalizes the classical result about the equivalence of Codd’s relational algebra and tuple (domain) relation calculus. Concept of table (relation) is considered in terms of nominal sets. Under relation is understood any set of tuples (with common scheme), in particular infinite. Furthermore only one universal domain is considered. The classical relational calculi are filled up by functional and predicate signatures on the universal domain (while usually consider only binary predicates and functional signature is generally empty).