Glyshko I. Calculi and extensions of table algebras signature

Specifying of table in terms of nominative sets is carried out by V. Redko, J. Brona, D. Buy, and S. Poliakov. Traditionally the finite set of tuples is understood under the table and the authors take it into account. However, as a rule, mathematical statements about standard properties of relation operations remain true for infinite relations. In the dissertation under relation it is understood any set of tuples (with common scheme), in particular infinite. In the dissertation table algebras for infinite and finite tables are considered. The classical relational calculi are filled up by functional and predicate signatures on the universal domain, while in classical case it is considered only binary predicates and functional signature is generally empty. On the one hand, it is proved the equivalence of table algebra for infinite tables and corresponding relational calculi, and on the other hand, it is showed the equivalence of subalgebra of finite tables of the given algebra and corresponding relational calculi in which consideration is limited to only so-called "safe" expressions.