This paper gives a fast algorithm based on the concepts of cofactor Shannon expansion and unate function to recursively and quickly judge if a given cube array of logical function is a tautology .

本文给出一种高效的永真式判定算法，该算法利用余因子、Shannon展开式和 单边 函数，对逻辑函数的多维体列阵进行快速有效的递归判定。

The author in this paper derives a solution for any two-level network refering to the approach for minimum complete test set of two-level combinative network 's faults of unate function .

本文参考 单调二级组合电路求解故障最小完全测试集的方法，推导出了任意二级组合电路的 算法。