Sequential Calculi for Symmetric Dynamic Logic
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.
KeywordsModal Logic Induction Step Predicate Symbol Propositional Variable Sequential Calculus
Unable to display preview. Download preview PDF.
- Ershov, Y.L., 1983, Dynamic Logic over Admissible Sets, Dokl. Akad. Nauk USSR, 273:1045–1048.Google Scholar
- Harel, D., 1979, First-order Dynamic Logic, Lect. Notes Comp. Sci., 68.Google Scholar
- 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
- 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
- Hilbert, D. and Bernays, P., 1934, “Grundlagen der Mathematik, I,” Springer, Berlin.Google Scholar
- Kleene, S. K., 1952, “Introduction to Metamathematics,” North-Holland, Amsterdam.Google Scholar
- Pratt, V. R., 1976, Semantical Considerations on Floyd-Hoare Logic, in: “Proc. 17th IEEE Symp. on Found, of Comp. Sci.,” 109-121.Google Scholar
- Pratt, V. R., 1979, Dynamic Logic, Mathematical Centre Tracts (Amsterdam), 109:53–82.Google Scholar
- Salwicki, A., 1970, A Formalized Algorithmic Language, Bull. Acad. Pol. Sci., Ser. Sci. Math. Astr. Phys., 18:227–232.Google Scholar
- 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