摘要
将符号化计算树逻辑中Boole函数的Shannon展开式做了推广,研究了三值逻辑系统L3*中由公式导出的三值R0函数的展开式,给出了L3*中逻辑公式的准析取范式和准合取范式表示.研究了n元三值R0函数以及n元逻辑公式逻辑等价类的计数问题.在此基础上,给出了L3*中对称逻辑公式的构造方法.
Shannon expansion of Boole function in symbolic computation tree logic is generalized. In three-valued logic system L3*, the expansions of symmetric three-valued R0 function which are induced by logical formulae are studied, and the quasi disjunctive normal form and quasi conjunc- tive normal form of logical formulae are given. The counting problems of n-ary three-valued R0 functions and n-ary logical formulae are studied. Then the construction method of symmetrical logic formulae in L3* is given.
出处
《计算机学报》
EI
CSCD
北大核心
2013年第4期851-861,共11页
Chinese Journal of Computers
基金
国家自然科学基金(11171200
61005046
61103133)
教育部高等学校博士学科点专项科研资金(20100202120012)资助~~