| The Expressibility of First Order Dynamic Logic |
| |
| 引用本文： | Fu Bin,Li Qiongzhang. The Expressibility of First Order Dynamic Logic[J]. 计算机科学技术学报, 1992, 7(3): 268-273. DOI: 10.1007/BF02946577 |
| |
| 作者姓名： | Fu Bin Li Qiongzhang |
| |
| 作者单位： | Department of Computer Science Wuhan University Wuhan 430074，Department of Computer Science Wuhan University Wuhan 430074，Department of Computer Science Beijing Computer Institute Beijing 100044 P. R. China. |
| |
| 基金项目： | Supported by HTP863，the fund of Beijing laboratory of cognitive science |
| |
| 摘 要： | This paper resolved an open problem proposed by A .P. Stolboushkin and M .A. Taitslin.We studied the expressibility of first order dynamic logic, and constructed infinite recursive programclasses K_1 , K_2, …, RG K_1 K_2 … RF, such that L (RG)
|
| 关 键 词： | 程序集 可表达性 动力逻辑 |
The expressibility of first order dynamic logic |
| |
| Bin Fu,Qiongzhang Li. The expressibility of first order dynamic logic[J]. Journal of Computer Science and Technology, 1992, 7(3): 268-273. DOI: 10.1007/BF02946577 |
| |
| Authors: | Bin Fu Qiongzhang Li |
| |
| Affiliation: | Department of Computer Science Wuhan University Wuhan; Department of Computer Science Wuhan University Wuhan; Department of Computer Science Beijing Computer Institute Beijing 100044 P. R. China.; |
| |
| Abstract: | This paper resolved an open problem proposed by A. P. Stolboushkin and M. A. Taitslin[6]. We studied the expressibility of first order dynamic logic, and constructed infinite recursive program classesK 1,K 2, ...,RG⊆K 1⊆K2⊆…⊆RF, such thatL, (RG)<L(K 1)2)<…<L(RF), whereRG, RF are regular program class and finitely generated recursively enumerable program class respectively, andL(K) is the first order dynamic logic of program classK. Supported by HTP863 and the fund of Beijing laboratory of cognitive science. |
| |
| Keywords: | |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载免费的PDF全文 |
