Skip to main content
Log in

Arithmetical completeness versus relative completeness

  • Published:
Studia Logica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. R. Apt, Ten years of Hoare Logics, TOPLAS 3 (4), pp. 431–482, 1981.

    Google Scholar 

  2. E. M. Clarke, Programming language constructs for which it is impossible to obtain good Hoare axiom systems, J. Assoc. Comput. Mach. No. 1, 1979.

  3. E.Clarke, S. German and J. Halpern, On effective axiomatization of Hoare Logics, JACM 1983.

  4. S. Cook, Soundness and completeness of axiom system for program verification, SIAM J. Comput. 7, No. 1, pp. 70–90, 1978.

    Google Scholar 

  5. 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.

  6. D. Harel, Logics of programs axiomatics and descriptive power, Report MIT LGS TR-200, 1978.

  7. R. A. Lipton, Necessary and sufficient condition for existence of Hoare logics, Proceedings of the 18th IEEE Symp. Found, of Comp. Sc., 1977.

  8. E. R. Olderog, Sound and complete Hoare-like calculi based on copy-rules, Acta Informatica 16, pp. 161–197, 1981.

    Google Scholar 

  9. J. Shoenfield, Mathematical Logic, 1967.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370552

Keywords

Navigation