Institutional Repository
| 命题模态逻辑的模型构造和完备性证明 | |
| Alternative Title | MODEL CONSTRUCTION AND COMPLETENESS PROOF OF PROPOSITIONAL MODAL LOGIC |
| 柳欣欣; 李小燕 | |
| 2014 | |
| Source | 计算机应用与软件
 |
| ISSN | 1000-386X |
| Volume | 31Issue:8Pages:9-12,24 |
| English Abstract | 模态逻辑是研究必然、可能及其相关概念的逻辑.模态公式的可满足性问题和证明系统的完备性问题是模态逻辑中的两个经典的问题.为了解决这两个问题,提出一个构造模态公式的canonical model的方法.通过这个方法,对于给定模态公式(φ),如果(φ)是可满足的,可以得到(φ)的一个canonical model;如果(φ)是不可满足的,可以得到(Γ)(φ)的证明.此外,还给出命题模态逻辑完备性的一个构造性证明方法. |
| Indexed Type | CSCD |
| Abstract | Propositional modal logic is the logic studying the necessity,possibility and their correlated concepts. The satisfiability problem of model formula and the proof of system completeness problem are two classic problems in modal logic. To solve these two problems, we propose a method of canonical model to construct the modal formula. By this method,for a given model formula phi, if phi is satisfiable,a canonical model can be obtained for it ; but if phi is not satisfiable,a proof of its negation- phi is to be obtained. In addition,in the paper we also give a constructive proof method of the completeness of the propositional modal logic. |
| Keyword | Fisher-ladner闭包 Canonical Model R规则 可满足性 完备性 Fisher-ladner Closure Canonical Model R-rule Satisfiability Completeness |
| Department | 中国科学院软件研究所计算机科学国家重点实验室 北京100190 中国科学院软件研究所计算机科学国家重点实验室 北京100190 ;中国科学院研究生院 北京100190 ;中国科学院大学 北京 100190 |
| Language | 中文 |
| CSCD ID | CSCD:5209184 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16717 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | 柳欣欣,李小燕. 命题模态逻辑的模型构造和完备性证明[J]. 计算机应用与软件,2014,31(8):9-12,24. |
| APA | 柳欣欣,&李小燕.(2014).命题模态逻辑的模型构造和完备性证明.计算机应用与软件,31(8),9-12,24. |
| MLA | 柳欣欣,et al."命题模态逻辑的模型构造和完备性证明".计算机应用与软件 31.8(2014):9-12,24. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment