| 命题公式集F(S)在Godel系统中的一个24类分划 |
| |
| 引用本文： | 张花荣. 命题公式集F(S)在Godel系统中的一个24类分划[J]. 兰州理工大学学报, 2009, 35(6) |
| |
| 作者姓名： | 张花荣 |
| |
| 作者单位： | 中国计量学院,理学院,浙江,杭州,310018 |
| |
| 摘 要： | 将基于R0-蕴涵算子按确定集分类的方法推广到Godel系统中,在Godel系统中引入确定集的概念,并按不同确定集对Godel系统中的公式集F(S)进行分类,得到F(S)在Godel系统中的一个24类分划.证明这种划分关于┐是同余的.
|
| 关 键 词： | 分划 Godel系统 确定集 封闭类 |
A 24-class partition of propositional formula set F(S) in Godel system |
| |
| ZHANG Hua-rong. A 24-class partition of propositional formula set F(S) in Godel system[J]. Journal of Lanzhou University of Technology, 2009, 35(6) |
| |
| Authors: | ZHANG Hua-rong |
| |
| Affiliation: | ZHANG Hua-rong(School of Science,China Jiliang University,Hangzhou 310018,China) |
| |
| Abstract: | The R0-implicit operator-based partition method of validation was generalized into Godel system.By means of introduction of the concept of validation set in Godel system,the propositional formula set F(s) was partitioned into twenty-four classes and it was proved that this partition was congruent about negation. |
| |
| Keywords: | partition Godel system validation set closed class |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
