Innovations in the “Boolean Functions” Section of the Discrete Mathematics Course

This paper proposes innovations in teaching the course of discrete mathematics at universities, innovations refer to the “Boolean functions” section. A fast method for constructing the Zhegalkin polynomial for a given Boolean function is proposed. Also, for the use of Post’s theorem on the functional completeness is proposed a visual method for determining the presence of monotonicity of a Boolean function and a convenient criterion for determining whether given Boolean function is affine.