全功能联结词集合的计算机实现

对数理逻辑中的各种联结词所构成的集合进行了讨论,并用计算机编程进行理论推导,把逻辑推理转化为计算机能够实现的0,1运算,用计算机实现了逻辑推理的全过程.得到的主要结果是:全功能联结词集合一共11个,其中,一阶全功能联结词集合2个;二阶全功能联结词集合7个;三阶全功能联结词集合2个;没有四阶及四阶以上的全功能联结词集合.这便修正了近年来有关全功能联结词的一个错误结论.

Full-function set of connectives by a computer

This paper discusses the set of the various connectives in mathematical logic,makes theoretical deduction by computer programming.To translate the logic reasoning into 0,1 operations achieved by a computer.The entire process of the logic deduction is realized by a computer.In this paper,the main findings are a total of 11 full-function integrated words,including two first order full-function sets of connectives,seven second order full-function sets of connectives and two third order full-function sets of connectives.There are not fourth order and more than fourth order full-function sets of connectives.So that,this paper modifies a mistake about the full-function sets of connectives which has occurred in recent years.