On axiomatization of process logic

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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Pratt V.R. A practical decision method for propositional dynamic logic. 10th Ann. ACM Symp. on Theory of Computing, 1978, 326–337.Google Scholar
  2. 2.
    Pratt V.R. Process logic:preliminary report. 6th Ann. ACM Symp. on Principles of Programming languages, 1979, 93–100.Google Scholar
  3. 3.
    Pratt V.R. Dynamic logic. Foundations of Computer Science, Mathematical Centre Tracts, 109, Amsterdam, 1979.Google Scholar
  4. 4.
    Nishimura H. Descriptively complete process logic. Acta Informatica, 14 (1980), 359–369.Google Scholar
  5. 5.
    Harel D., Kozen D., Parikh R. Process logic: expressiveness, decidability, completeness. 21st IEEE Symp. on Foundations of Computer Science, 1980, 129–142.Google Scholar
  6. 6.
    Fischer M.J., Ladner R.E. Propositional dynamic logic of regular programs. J. of Comput. Syst. Sci., 18 (1979), 194–211.Google Scholar
  7. 7.
    Harel D., Pratt V.R. Nondeterminism in logics of programs. 5th ACM Symp. on Principles of Programming languages, 1978.Google Scholar
  8. 8.
    Hoare C.A.R. An axiomatic basis for computer programming. Comm. ACM, 12(1969), 575–580.Google Scholar
  9. 9.
    Schutte K. Vollstandige Systeme modaler und intuitionistischer Logik. Ergebnisse der Mathematìk und ihrer Grenzgebiete, 1968, 42.Google Scholar
  10. 10.
    Nishimura H. Sequential method in propositional dynamic logic. Acta Informatica, 12 (1979), 377–400.Google Scholar
  11. 11.
    Kozen D., Parikh R. An elementary proof of the completeness of PDL. Theoretical Computer Science, 1981.Google Scholar
  12. 12.
    Ben-Ari M. Complexity of proofs and models in programming logics. Dissertation, Tel-Aviv Univ., 1981.Google Scholar
  13. 13.
    Valiev M.K. On axiomatization of deterministic propositional dynamic logic. Lect. Notes Comput. Sci., 74 (1979), 482–491.Google Scholar
  14. 14.
    Valiev M.K. Decision complexity of variants of propositional dynamic logic. Lect. Notes Comput. Sci., 88 (1980), 656–664.Google Scholar
  15. 15.
    Chlebus B. On the decidability of propositional algorithmic logic. Manuscript, 1980.Google Scholar
  16. 16.
    Pratt V.R. A near optimal method for reasoning about action. MIT/LCS Report TM-113, 1978.Google Scholar
  17. 17.
    Valiev M.K. Gentzen-style axiomatization of symmetric discrete linear time (to appear in the book of Russian authors on non-classical logics, Reidel Co.).Google Scholar
  18. 18.
    Prior A. Past, Present and Future. Clarendon Press, Oxford, 1967.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • M. K. Valiev
    • 1
  1. 1.Institute of MathematicsNovosibirskUSSR

Personalised recommendations