Skip to main content
SpringerLink
Log in

Propositional logics of programs: New directions

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 158))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chandra, A., Kozen, D., and Stockmeyer, L., "Alternation", J. ACM 28, (1981) 114–133.

    Article  Google Scholar 

  2. Ehrenfeucht, A., "An Application of Games to to the Completeness Problem for Formalised Theories", Fund. Math., 49 (1961) 129–141.

    Google Scholar 

  3. S. Even, A. Paz and M. Rabin, oral communication.

    Google Scholar 

  4. M. Fischer and R. Ladner, "Propositional Dynamic Logic of Regular Programs", J. Comp. and System Science 18 (1979) 194–211.

    Google Scholar 

  5. Gurevich, Y., and Harrington, L., "Trees, Automata, and Games", Proc. 14th STOC Symposium, 1982, 60–65.

    Google Scholar 

  6. Kozen, D., "Results on the Propositional μ-calculus", Proc 9th ICALP (1982) Springer LNCS vol 348–359

    Google Scholar 

  7. D. Kozen and R. Parikh, "An Elementary Proof of the Completeness of PDL", Theor. Comp. Sci. 14 (1981) 113–118.

    Article  Google Scholar 

  8. Kozen, D., and Parikh, R., "A Decision Procedure for the Propositional μ-calculus", Typescript, April 1983.

    Google Scholar 

  9. A. Meyer and R. Parikh, "Definability in Dynamic Logic", JCSS 23 (1981) 271–298.

    Google Scholar 

  10. Mycielski, J., and Steinhaus, H., "A Mathematical Axiom Contradicting the Axiom of Choice", Bull. Acad. Pol. Sci., 10, (1962) 1–3.

    Google Scholar 

  11. R. Parikh, "The Completeness of Propositional Dynamic Logic", Proc. 7th Symp. on Math. Found. Comp. Sci, Springer LNCS 64 403–415.

    Google Scholar 

  12. R. Parikh, "Propositional Dynamic Logics of Progarms: A Survey", Logics of Programs Ed. E. Engeler, Springer LNCS 125 102–144.

    Google Scholar 

  13. R. Parikh, "A Completeness Result for a Propositional Game Logic", Manuscript, Nov. 1982.

    Google Scholar 

  14. V. Pratt, "A Decidable mu-calculus (Preliminary report)" IEEE-FOCS 22 (1981) 421–428.

    Google Scholar 

  15. Rabin, M., "Decidability of Second Order Theories and Automata on Infinite Trees", Tran. AMS, 141 (1969) 1–35.

    Google Scholar 

  16. Streett, R., "Propositional Dynamic Logic of Looping and Converse", Proc. 13th STOC (1981) 375–383.

    Google Scholar 

  17. von Neumann, J., and Morgenstern, O., the Theory of Games and Economic Behavior, Princeton Univ. Press, 1944.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Brooklyn College, 11210, Brooklyn, NY

    Rohit Parikh

Authors
  1. Rohit Parikh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parikh, R. (1983). Propositional logics of programs: New directions. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_117

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_117

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation