Propositional logics of programs: New directions

  • Rohit Parikh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


We discuss new developments in Propositional Logic of Programs, specifically the μ-calculus, and Game Logic. While this paper is intended largely as a survey, some new results are stated.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CKS]
    Chandra, A., Kozen, D., and Stockmeyer, L., "Alternation", J. ACM 28, (1981) 114–133.CrossRefGoogle Scholar
  2. [E]
    Ehrenfeucht, A., "An Application of Games to to the Completeness Problem for Formalised Theories", Fund. Math., 49 (1961) 129–141.Google Scholar
  3. [EPR]
    S. Even, A. Paz and M. Rabin, oral communication.Google Scholar
  4. [FL]
    M. Fischer and R. Ladner, "Propositional Dynamic Logic of Regular Programs", J. Comp. and System Science 18 (1979) 194–211.Google Scholar
  5. [GH]
    Gurevich, Y., and Harrington, L., "Trees, Automata, and Games", Proc. 14th STOC Symposium, 1982, 60–65.Google Scholar
  6. [K]
    Kozen, D., "Results on the Propositional μ-calculus", Proc 9th ICALP (1982) Springer LNCS vol 348–359Google Scholar
  7. [KP1]
    D. Kozen and R. Parikh, "An Elementary Proof of the Completeness of PDL", Theor. Comp. Sci. 14 (1981) 113–118.CrossRefGoogle Scholar
  8. [KP2]
    Kozen, D., and Parikh, R., "A Decision Procedure for the Propositional μ-calculus", Typescript, April 1983.Google Scholar
  9. [MP]
    A. Meyer and R. Parikh, "Definability in Dynamic Logic", JCSS 23 (1981) 271–298.Google Scholar
  10. [MS]
    Mycielski, J., and Steinhaus, H., "A Mathematical Axiom Contradicting the Axiom of Choice", Bull. Acad. Pol. Sci., 10, (1962) 1–3.Google Scholar
  11. [P1]
    R. Parikh, "The Completeness of Propositional Dynamic Logic", Proc. 7th Symp. on Math. Found. Comp. Sci, Springer LNCS 64 403–415.Google Scholar
  12. [P2]
    R. Parikh, "Propositional Dynamic Logics of Progarms: A Survey", Logics of Programs Ed. E. Engeler, Springer LNCS 125 102–144.Google Scholar
  13. [P3]
    R. Parikh, "A Completeness Result for a Propositional Game Logic", Manuscript, Nov. 1982.Google Scholar
  14. [Pr]
    V. Pratt, "A Decidable mu-calculus (Preliminary report)" IEEE-FOCS 22 (1981) 421–428.Google Scholar
  15. [Ra]
    Rabin, M., "Decidability of Second Order Theories and Automata on Infinite Trees", Tran. AMS, 141 (1969) 1–35.Google Scholar
  16. [St]
    Streett, R., "Propositional Dynamic Logic of Looping and Converse", Proc. 13th STOC (1981) 375–383.Google Scholar
  17. [vNM]
    von Neumann, J., and Morgenstern, O., the Theory of Games and Economic Behavior, Princeton Univ. Press, 1944.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Rohit Parikh
    • 1
  1. 1.Department of Computer ScienceBrooklyn CollegeBrooklyn

Personalised recommendations