Advertisement

Sequential Calculi for Symmetric Dynamic Logic

  • Regimantas Pliuškevičius

Abstract

The algorithmic logic of Salwicki (1970, 1977) and dynamic logic of Pratt (1976, 1979) represent a rather successful synthesis of modal logic and Hoare’s (1969) logic. Algorithmic and dynamic logics are of great importance not only in computer science but also in mathematics: Ershov (1983) has shown that dynamic logic is closely related to admissible sets.

Keywords

Modal Logic Induction Step Predicate Symbol Propositional Variable Sequential Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ershov, Y.L., 1983, Dynamic Logic over Admissible Sets, Dokl. Akad. Nauk USSR, 273:1045–1048.Google Scholar
  2. Gentzen, G., 1934/35, Untersuchungen über das logische Schließen, Math. Zeitschr., 39:176–210, 405–431.CrossRefGoogle Scholar
  3. Harel, D., 1979, First-order Dynamic Logic, Lect. Notes Comp. Sci., 68.Google Scholar
  4. Harel, D., Meyer, A. R. and Pratt, V. R., 1977, Computability and Completeness in Logic of Programs, in: “Proc. 9th Ann. ACM Symp. on Theory of Computing,” Boulder, Col., 261-268.Google Scholar
  5. Harel, D., Pnueli, A. and Stavi, J., 1977, A Complete Axiomatic System for Proving Deductions about Recursive Programs, in: “Proc. 9th Ann. ACM Symp. on Theory of Computing,” 249-260.Google Scholar
  6. Hilbert, D. and Bernays, P., 1934, “Grundlagen der Mathematik, I,” Springer, Berlin.Google Scholar
  7. Hoare, C. A. R., 1969, An Axiomatic Basis for Computer Programming, Journal of the ACM, 12:576–580.CrossRefGoogle Scholar
  8. Kleene, S. K., 1952, “Introduction to Metamathematics,” North-Holland, Amsterdam.Google Scholar
  9. Meyer, A. R. and Halpern, J., 1982, Axiomatic Definitions of Programming Languages: A Theoretical Assessment, Journal of the ACM, 29:555–576.CrossRefGoogle Scholar
  10. Nishimura, H., 1979, Sequential Method in Propositional Dynamic Logic, Acta Informatica, 12:377–400.CrossRefGoogle Scholar
  11. Parikh, R., 1978, A Completeness Result for PDL, Lect. Notes Comp. Sci., 64:403–416.CrossRefGoogle Scholar
  12. Pratt, V. R., 1976, Semantical Considerations on Floyd-Hoare Logic, in: “Proc. 17th IEEE Symp. on Found, of Comp. Sci.,” 109-121.Google Scholar
  13. Pratt, V. R., 1979, Dynamic Logic, Mathematical Centre Tracts (Amsterdam), 109:53–82.Google Scholar
  14. Salwicki, A., 1970, A Formalized Algorithmic Language, Bull. Acad. Pol. Sci., Ser. Sci. Math. Astr. Phys., 18:227–232.Google Scholar
  15. Salwicki, A., 1977, Algorithmic Logic, a Tool for Investigations of Programs, in: “Proc. of 5th Int. Congress of Logic, Meth. and Ph. of Sci.,” I, 281-295, Reidel, Dordrecht.Google Scholar

Copyright information

© Springer Science+Business Media New York 1985

Authors and Affiliations

  • Regimantas Pliuškevičius
    • 1
  1. 1.Institute of Mathematics and CyberneticsLithuanian SSR Academy of SciencesVilniusLithuania

Personalised recommendations