Skip to main content
SpringerLink
Log in

Dynamic logic as a uniform framework for theorem proving in intensional logic

  • Conference paper
  • First Online:
10th International Conference on Automated Deduction (CADE 1990)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 449))

Included in the following conference series:

Abstract

Dynamic logic is proposed as a uniform framewok for theorem proving in propositional intensional logic. Satisfiability and unsatisfiability preserving translations from various modal, deontic, epistemic, temporal, and intuitionistic calculi into dynamic logic calculi are defined and partly proved to be correct. The translations unify theorem proving in intensional logic by using dynamic logic as an intermediate logic for which the actual theorem provers can be implemented.

This research was supported by the Academy of Finland.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Åqvist, L. Deontic logic. In Handbook of Philosophical Logic, Volume II: Extensions of Classical Logic, D. Gabbay and F. Guenthner, Eds., D. Reidel Publishing Company, Dordrecht, 1984, pp. 605–714.

    Google Scholar 

  2. Ben-Ari, M., Halpern, J., and Pnueli, A. Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness. Journal of Computer and System Sciences 25 (1982), 402–417.

    Google Scholar 

  3. Chellas, B. Modal Logic, an Introduction. Cambridge University Press, Cambridge, 1980.

    Google Scholar 

  4. van Dalen V. Intuitionistic logic. In Handbook of Philosophical Logic, Volume III: Alternatives to Classical Logic, D. Gabbay, and F. Guenthner, Eds., D. Reidel Publishing Company, Dordrecht, 1986, pp. 225–339.

    Google Scholar 

  5. Emerson, E., and Jutla, C. The Complexity of Tree Automata and Logics of Programs. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science (White Plains). 1988, pp. 328–337.

    Google Scholar 

  6. Emerson, E., and Srinivasan, J. Branching Time Temporal Logic. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (School/Workshop, Noordwijkerhout, The Netherlands, May/June 1988), J. de Bakker, W. de Rover, and G. Rozenberg, Eds., Springer-Verlag, Berlin, 1989, pp. 123–172.

    Google Scholar 

  7. Fischer, M., and Ladner, R. Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences 18 (1979), 194–211.

    Google Scholar 

  8. Goldblatt, R. Logics of Computation and Time. Center for the Study of Language and Information, Leland Stanford Junior University, 1987.

    Google Scholar 

  9. Halpern, J., and Moses, Y. A guide to the modal logics of knowledge and belief: preliminary draft. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence (Los Angeles, Aug. 18–23). Morgan Kaufmann, Los Altos, California, 1985, pp. 481–490.

    Google Scholar 

  10. Halpern, J, and Reif, J. The Propositional Dynamic Logic of Deterministic Well-Structured Programs. Theoretical Computer Science 27 (1983), 204–216.

    Google Scholar 

  11. Harel, D. Dynamic logic. In Handbook of Philosophical Logic, Volume II: Extensions of Classical Logic, D. Gabbay and F. Guenthner, Eds., D. Reidel Publishing Company, Dordrecht, 1984, pp. 497–604.

    Google Scholar 

  12. Hughes, G., and Cresswell, M. An Introduction to Modal Logic. Methuen and Co Ltd, London, 1968.

    Google Scholar 

  13. Ladner, R. The Computational Complexity of Provability in Systems of Modal Propositional Logic. SIAM Journal of Computing 6 (1977), 467–480.

    Google Scholar 

  14. McArthur, R. Tense Logic. D. Reidel Publishing Company, Dordrecht, 1976.

    Google Scholar 

  15. Parikh, R. Logics of Knowledge, Games and Dynamic Logic. In Foundations of Software Technology and Theoretical Computer Science. Springer-Verlag, Berlin, 1984, pp. 202–222.

    Google Scholar 

  16. Pinter, S., and Wolper, P. A Temporal Logic for Reasoning about Partially Ordered Computations. In Proceedings of the third ACM Symposium on Principles of Distributed Computing (Vancouver). 1984, pp. 28–37.

    Google Scholar 

  17. Pratt, V. Models of Program Logics. In Proceedings of the 20th IEEE Conference on Foundations of Computer Science (San Juan, Oct.). 1979, pp. 115–122.

    Google Scholar 

  18. Pratt, V. A Near-Optimal Method for Reasoning about Action. Journal of Computer and System Sciences 20 (1980), 231–254.

    Google Scholar 

  19. Vardi, M., and Wolper, P. Automata-Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences 32 (1986), 183–221.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Nokia Telecommunications, P.O.Box 33, SF-02601, Espoo, Finland

    Heikki Tuominen

Authors
  1. Heikki Tuominen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mark E. Stickel

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tuominen, H. (1990). Dynamic logic as a uniform framework for theorem proving in intensional logic. In: Stickel, M.E. (eds) 10th International Conference on Automated Deduction. CADE 1990. Lecture Notes in Computer Science, vol 449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52885-7_111

Download citation

  • DOI: https://doi.org/10.1007/3-540-52885-7_111

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52885-2

  • Online ISBN: 978-3-540-47171-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation