| n值命题逻辑系统Ln*中有限命题集的相容性与约简 |
| |
| 引用本文： | 李立峰. n值命题逻辑系统Ln*中有限命题集的相容性与约简[J]. 计算机工程与应用, 2009, 45(13): 59-61. DOI: 10.3778/j.issn.1002-8331.2009.13.017 |
| |
| 作者姓名： | 李立峰 |
| |
| 作者单位： | 西安邮电学院,应用数理系,西安,710121 |
| |
| 基金项目： | 陕西省科学技术研究发展计划 |
| |
| 摘 要： | 设Г为有限命题集，首先讨论了Г在不同的n值命题逻辑系统Ln*中的相容性问题，提出了Г的约简理论，从命题集Г所诱导的多值形式背景出发，运用概念格的方法从Г及其子集的关系出发给出了Г约简的判定定理。
|
| 关 键 词： | 完备性定理 相容性 T约简 概念格 |
| 收稿时间： | 2008-12-12 |
Consistency and reduction of finite proposition set in n-valued propositional logic Ln* |
| |
| 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. DOI: 10.3778/j.issn.1002-8331.2009.13.017 |
| |
| Authors: | LI Li-feng |
| |
| Affiliation: | Department of Applied Mathematics and Physics，Xi’an Institute of Posts and Telecommunications，Xi’an 710121，China |
| |
| 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 Г. |
| |
| Keywords: | |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
