Abstract: In article[1] the necessary and sufficient condition is given, under which the Boolean function on {0, 1} can be resolved into inclusive-or logic operation of increasing function and decreasing function. In this article we extend this condition to other binary logic operations. In addition, accorcing bo the Boolean isomorphism theorem we also give monotone decomposition theorems of n-ary function on Boolean algebra B≠{0,1}.