%0 Journal Article
%T Some Results on the Minimal Coverings of Precomplete Classes in Partial k-Valued Logic Functions
%A Ren-Ren Liu
%A Song-Qiao Chen
%A Jian-Er Chen
%A Shu Li
%A <br>Ren-RenLiu
%A Song-QiaoChen
%A Jian-ErChen
%A ShuLi
%J 计算机科学技术学报
%D 2004
%I 
%X In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, some Full Symmetric Function Sets (m = 3) are proved to be components of the minimal covering of precomplete classes in Pk*.
%K multiple-valued logic
%K completeness
%K ShefFer function
%K precomplete class<br>多值逻辑
%K 完整性
%K 与非方程
%K 最小覆盖
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=0790EF675EDF1BFE81196B566734CE32&yid=D0E58B75BFD8E51C&vid=2A8D03AD8076A2E3&iid=B31275AF3241DB2D&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=6&reference_num=19