NBL^＊形式系统  

NBL^＊ system

作　　者：王伟华[1] 吴洪博[1] 

机构地区：[1]陕西师范大学数学与信息科学学院,陕西西安710062

出　　处：《纺织高校基础科学学报》2008年第3期262-269,共8页Basic Sciences Journal of Textile Universities

基　　金：国家自然科学基金资助项目(10471083);陕西师范大学重点科研基金资助项目(995130)

摘　　要：将非交换BR0代数形式化,从而简化它的定义,使其更具有逻辑代数的特征.利用逻辑代数与其命题演算系统之间存在的完备性思想,通过对非交换BR0代数定义的进一步研究,得出与它相对应的形式系统NBL*的公理,进而得到其上的[F]完备性和广义演绎定理成立,即NBL*形式系统与非交换BR0代数之间具有一定的和谐性.The non-commutative BR0-algebra is formalized and its definition is simplified and also it have more feature of logic algebra. Using the completeness thought existing between logic algebra and its propositional calculus,and through the study of the definition of the non-commutative BR0-algebra, the axiom of NBL^＊ system is established. Then the completeness and pseudo-deductive theory of NBL^＊ system is proved. That is there is some compatibility between the non-commutative BR0-algebra and NBL^＊ system.

关 键 词：非交换BR0代数 NBL^＊形式系统 命题演算系统 

分 类 号：O141.1[理学—数学]