Abstract：This paper proposes a theorem on the relationship between the solution set of the logic equation and a logic equation approach which transforms the logic equation F=G into zero type or one type, along with its corresponding counter parts and their proofs. The solution sets of equation F=G is just S1－S2 if the solution sets for the equations F+G〖TX-〗=1 and FG〖TX-〗=1 are S1 and S2, respectively. If the solution sets for the equations F+G=0 and F〖TX-〗+G〖TX-〗=0 present S3 and S4, respectively, then the solution set for equation F=G is S3 ∪ S4. Assume that the solution sets for equation FG=1 and F〖TX-〗·G〖TX-〗=1 are S5 and S6 respectively, the solution set of logic equation F=G is S5 U S6. Similarly, one infers that if the solution sets of logic equations〖JB({〗F=1G=1〖JB)〗 and 〖JB({〗F=0G=0〖JB)〗 are X1 and X2 respectively, the solution set of logic equation F=G will be X1 ∪ X2. These above results can be devoted to investigate other related logic equations with nonzero and nonone types.
2015, Vol. 42 
