%0 Journal Article
%T The expressibility of first order dynamic logic<br>The Expressibility of First Order Dynamic Logic
%A Bin Fu
%A Qiongzhang Li
%A <br>Fu Bin
%A Li Qiongzhang
%J 计算机科学技术学报
%D 1992
%I 
%X This paper resolved an open problem proposed by A. P. Stolboushkin and M. A. Taitslin6]. 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)<L(K2)<…<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.
%K 程序集
%K 可表达性
%K 动力逻辑
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=C5CD5909C3D7BA0FE9ECD0DE934E4ABD&yid=F53A2717BDB04D52&vid=DF92D298D3FF1E6E&iid=38B194292C032A66&sid=DC330B09A33F1455&eid=9F8C5EF901EA1E7E&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=6