Logic of Programs 1983: Logics of Programs pp 313-325 | Cite as

A decision procedure for the propositional μ-calculus

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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [FL]
    Fischer, M.J. and R.E. Ladner, "Propositional Dynamic Logic of Regular Programs," J. Comput. Syst. Sci. 18:2 (1979), 194–211.Google Scholar
  2. [K]
    Kozen, D., "Results on the propositional μ-calculus," Proc. 9th Int. Colloq. on Automata, Languages, and Programming, 1982, Springer-Verlag, 348–359.Google Scholar
  3. [P]
    Pratt, V.R., "A Decidable μ-calculus (preliminary report)," Proc. 22nd IEEE Symp. on Foundations of Computer Science, 1981, 421–427.Google Scholar
  4. [R]
    Rabin, M.O., "Decidability of second-order theories and automata on infinite trees," Trans. Amer. Math. Soc. 141 (1969), 1–35.Google Scholar
  5. [S]
    Streett, R., "Propositional Dynamic Logic of looping and converse," Proc. 13th ACM Symp. on Theory of Computing, 1981, 375–383.Google Scholar
  6. [SDeB]
    Scott, D. and J. de Bakker, "A theory of programs," unpublished, Vienna, 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Dexter Kozen
    • 1
  • Rohit Parikh
    • 2
  1. 1.Mathematical Sciences DepartmentIBM ResearchYorktown Heights
  2. 2.Dept. of Computer and Information SciencesBrooklyn CollegeBrooklyn

Personalised recommendations