Abstract: In deep research on the Sheffer function in partial two-valued logic，an algorithm is proposed that can effectively construct the Sheffer function in partial two-valued logic based on the minimal covering of precomplete sets in partial two-valued logic.The algorithm can construct all Sheffer functions in partial two-valued logic.Corresponding to this algorithm，a determinant algorithm of the Sheffer function in partial two-valued logic which is compared to the traditional algorithm is also put forward.It avoids complex computations and can be considered to be a simpler determinant algorithm.

Key words: Sheffer functions, precomplete sets, minimal covering

摘要： 在深入研究部分二值逻辑中Sheffer函数的基础上，根据部分二值逻辑中准完备集的最小覆盖，提出了一种高效地构造部分二值逻辑中Sheffer函数的算法，此算法能够构造出部分二值逻辑中的全部Sheffer函数，在构造算法的基础上，进一步提出了一种部分二值逻辑中Sheffer函数的判定算法，此算法和传统判定算法相比，避免了繁琐的计算，可以说是一种较简单的判定算法。

关键词: Sheffer函数, 准完备集, 最小覆盖