计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (13): 59-61.DOI: 10.3778/j.issn.1002-8331.2009.13.017
• 研究、探讨 • 上一篇 下一篇
李立峰
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
LI Li-feng
Received:
Revised:
Online:
Published:
Contact:
摘要： 设Г为有限命题集，首先讨论了Г在不同的n值命题逻辑系统Ln*中的相容性问题，提出了Г的约简理论，从命题集Г所诱导的多值形式背景出发，运用概念格的方法从Г及其子集的关系出发给出了Г约简的判定定理。
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*中有限命题集的相容性与约简[J]. 计算机工程与应用, 2009, 45(13): 59-61.
LI Li-feng. Consistency and reduction of finite proposition set in n-valued propositional logic Ln*[J]. Computer Engineering and Applications, 2009, 45(13): 59-61.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/10.3778/j.issn.1002-8331.2009.13.017
http://cea.ceaj.org/CN/Y2009/V45/I13/59
