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)<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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. J. Fischer and R. E. Ladner, Propositional dynamic logic of regular programs.Journal of Computer and Systems Science, 1979, 18 (2), 194–211.
D. Harel, First-Order Dynamic Logic, Springer, Berlin, 1979.
J. E. Hoperoft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company, U. S. A., 1979, 285–376.
A. J. Kfoury, Definability by deterministic and non-deterministic programs (with application to first-order dynamic logic).Information and Control, 1985, 65 (2/3), 98–121.
M. Lerman. Degrees of Unsolvability, Springer, Berlin, 1983.
A. P. Stolboushkin and M. A. Taitslin, The comparison of the expressive power of first-order dynamic logics.Theoretical Computer Science, 1983, 27 (1/2), 197–209.
Author information
Authors and Affiliations
Additional information
Supported by HTP863 and the fund of Beijing laboratory of cognitive science.
Rights and permissions
About this article
Cite this article
Fu, B., Li, Q. The expressibility of first order dynamic logic. J. of Comput. Sci. & Technol. 7, 268–273 (1992). https://doi.org/10.1007/BF02946577
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946577