Abstract
In this paper we study the status of the arithmetical completeness of dynamic logic. We prove that for finitistic proof systems for dynamic logic results beyond arithmetical completeness are very unlikely. The role of the set of natural numbers is carefully analyzed.
Similar content being viewed by others
References
K. R. Apt, Ten years of Hoare Logics, TOPLAS 3 (4), pp. 431–482, 1981.
E. M. Clarke, Programming language constructs for which it is impossible to obtain good Hoare axiom systems, J. Assoc. Comput. Mach. No. 1, 1979.
E.Clarke, S. German and J. Halpern, On effective axiomatization of Hoare Logics, JACM 1983.
S. Cook, Soundness and completeness of axiom system for program verification, SIAM J. Comput. 7, No. 1, pp. 70–90, 1978.
M. Grabowski, On relative incompleteness of logics for total correctness, Proceedings of Logics of Programs Conference 85, New York, Lecture Notes on Comp. Sci., vol. 192, 1985.
D. Harel, Logics of programs axiomatics and descriptive power, Report MIT LGS TR-200, 1978.
R. A. Lipton, Necessary and sufficient condition for existence of Hoare logics, Proceedings of the 18th IEEE Symp. Found, of Comp. Sc., 1977.
E. R. Olderog, Sound and complete Hoare-like calculi based on copy-rules, Acta Informatica 16, pp. 161–197, 1981.
J. Shoenfield, Mathematical Logic, 1967.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Grabowski, M. Arithmetical completeness versus relative completeness. Stud Logica 47, 213–220 (1988). https://doi.org/10.1007/BF00370552
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370552