On generalized Boolean functions II

This cycle of papers is based on the concept of generalized Bolean functions introduced by the author in the first article of the series. Every generalized Boolean function f:Bⁿ→B can be written in a manner similar to the canonical disjunctive form using some function defined on A×B, where A is a finite subset of B containing 0 and 1. The set of those functions f is denoted by GBF_nA]. In this paper the following questions are presented: (1) What is the relationship between GBF_nA₁] and GBF_nA₂] when A₁A₂. (2) What can be said about GBF_nA₁∩A₂] and GBF_nA₁A₂] in comparison with GBF_nA₁]∩GBF_nA₂] and GBF_nA₁]GBF_nA₂], respectively.