An equation is called a finite equation if its solution set is a subset of a given finite set. Applying some kind of algebraic structure S. Prešić determined in [7] the formulas of all general reproductive solutions of such equations. Using Prešić's result we determine in this paper the formulas of all general reproductive solutions of arbitrary Boolean equations.