• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (2): 81-84.

• 论文 • 上一篇    下一篇

部分K值逻辑中完满对称函数集的确定和构造

龚志伟1 ,刘任任2   

  1. (1.中南林业科技大学理学院,湖南 长沙 410004;2.湘潭大学信息工程学院,湖南 湘潭 411105)
  • 收稿日期:2011-11-07 修回日期:2012-03-01 出版日期:2013-02-25 发布日期:2013-02-25
  • 基金资助:

    国家自然科学基金资助项目(60673193);中南林业科技大学校青年基金资助项目(QJ2010021B)

Determination and conformation of full symmetric function sets in partial Kvalued logic

GONG Zhiwei1,LIU Renren2   

  1. (1.College of Science, Central South University of Forestry and Technology,Changsha 410004; 2.College of Information Engineering,Xiangtan University,Xiangtan 411105,China)
  • Received:2011-11-07 Revised:2012-03-01 Online:2013-02-25 Published:2013-02-25

摘要:

根据部分K值逻辑的完备性理论,对于一般的K,首先确定了保二元完满对称函数集的个数,并给出了这些函数集的构造方法;然后确定了所有的完满对称函数集的个数,并给出了这些函数集的构造方法。

关键词: 多值逻辑, 准完备集, 完满对称函数集

Abstract:

According to the completeness theory in partial kvalued logic, firstly, the number of preserving binary full symmetric function sets is determined for general K, and the method of constructing these function sets is given out; secondly, the number of all full symmetric function sets is determined for general K, and the method of constructing these function sets is given out.

Key words: multiplevalued logic;precomplete sets;full symmetric function sets