ABSTRACT
Partial algebras axe one of the basic mathematical structures used in computer science. A partial algebra is a nonempty set together with a set of finitary par tial operations defined on this set. An indexed partial algebra A = (^ 4; (f^)iei) of type r is defined in the same manner as an indexed total algebra of type t , with the exception that now the operations f f on A are allowed to be partial operations on A. We will denote by PJf the set of all n-ary partial operations
oo defined on the set A, and by Pa U Pa the set of all partial operations on
A. For basic information on partial algebras we refer the reader to [22].
