The article considers partial Boolean functions classes closed under the E-closure (closure with branching on the equality predicate). A method of computerized exhaustive search is presented, leading to a description of all the E-closed classes of partial Boolean functions. For each of the 100 classes an E-generating system is given. The inclusion diagram of E-closed partial Boolean function classes is constructed.

partial Boolean functions, E-closure, classification

Mathematical problems and theory of numerical methods