Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (13): 59-61.DOI: 10.3778/j.issn.1002-8331.2009.13.017

• 研究、探讨 • Previous Articles     Next Articles

Consistency and reduction of finite proposition set in n-valued propositional logic Ln*

LI Li-feng   

  1. Department of Applied Mathematics and Physics,Xi’an Institute of Posts and Telecommunications,Xi’an 710121,China
  • Received:2008-12-12 Revised:2009-03-09 Online:2009-05-01 Published:2009-05-01
  • Contact: LI Li-feng

n值命题逻辑系统Ln*中有限命题集的相容性与约简

李立峰   

  1. 西安邮电学院 应用数理系,西安 710121
  • 通讯作者: 李立峰

Abstract: Let Г be finite theory,this paper discusses the consistency of Г in different n-valued propositional logic Ln* firstly,then the theory of Г-reduction in n-valued propositional logic Ln* is introduced.Several ways to determine the Г-reduction are studied by investigating the relationship between Г and their subsets since there has a formal multi-valued formal context deduced by the finite theory Г.

摘要: 设Г为有限命题集,首先讨论了Г在不同的n值命题逻辑系统Ln*中的相容性问题,提出了Г的约简理论,从命题集Г所诱导的多值形式背景出发,运用概念格的方法从Г及其子集的关系出发给出了Г约简的判定定理。