On generalized Boolean functions i

In this paper we introduce the concept of generalized Boolean function. Such a function has its arguments and values in a Boolean algebra and can be written in a manner similar to the canonical disjunctive form, but instead of the product of simple or complemented variables, the product of values of certain functions is used. Every Boolean function is a generalized Boolean one but the converse is not true. The set of all generalized Boolean function “generated” by some fixed function is a Boolean algebra.