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

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