Advertisement

On axiomatization of deterministic propositional dynamic logic

  • M. K. Valiev
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fischer M.J., Ladner R.E., Propositional modal logic of programs. Proc. 9th ACM Symp. on Theory of Computing, 1977, 286–294.Google Scholar
  2. 2.
    Pratt V.R., Semantical considerations on Floyd-Hoare logic. Proc. 17th IEEE Symp. on Found. of Comp. Sci., 1976, 109–121.Google Scholar
  3. 3.
    Segerberg K., A completeness theorem in the modal logic of programs. Notices of the AMS, 24 (1977), 6, A-552.Google Scholar
  4. 4.
    Parikh R., The completeness of propositional dynamiic logic. Lecture Notes in Computer Science, 64(1978), 403–413.Google Scholar
  5. 5.
    Gabbay D., Axiomatizations of logics of programs. Manuscript, under cover dated Nov. 1977 (the reference taken from [7]).Google Scholar
  6. 6.
    Segerberg K., A completeness theorem in the modal logic of programs. Manuscript, 1978.Google Scholar
  7. 7.
    Pratt V.R., A practical decision method for propositional dynamic logic. Proc. 10th ACM Symp. on Theory of Computing, 1978, 326–337.Google Scholar
  8. 8.
    Salwicki A., Formalized algorithmic languages. Bull. Acad. Pol. Sci., Ser. Sci. Math. Astr. Phys. 18(1970), No.5.Google Scholar
  9. 9.
    Mirkowska G., On formalized systems of algorithmic logic. Bull. Acad. Pol. Sci. Math. Astr. Phys. 19(1971), No.6.Google Scholar
  10. 10.
    Glushkov V.M., Automata theory and formal transformations of microprograms. Kybernetika, 1965, 5 (in Russian).Google Scholar
  11. 11.
    Glushkov V.M., Zeitlin G.E., Yushchenko E.L., Algebra, languages, programming. Kiev, 1974 (in Russian).Google Scholar
  12. 12.
    Semjonov A.L., Some algorithmic problems for systems of algorithmic algebras. Doklady AN SSSR, 239(1978), 5, 1063–1066 (in Russian).Google Scholar
  13. 13.
    Pratt V.R., On near-optimal method for reasoning about actions. MIT/LCS/TM-113, 1978.Google Scholar
  14. 14.
    Valiev M.K., Complete axiomatization of deterministic propositional dynamic logic. All-Union Symp. on Artificial Intelligence and Automatization of Math. Research. Kiev, 1978, 3–4 (in Russian).Google Scholar
  15. 15.
    Kimura T., An algebraic system for process structuring and interprocess communication. Proc. 8th ACM Symp. on Theory of Computing, 1976, 92–100.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • M. K. Valiev
    • 1
  1. 1.Institute of MathematicsNovosibirsk-90USSR

Personalised recommendations