Skip to main content
SpringerLink
Log in

Nondeterministic Propositional Dynamic Logic with intersection is decidable

  • Conference paper
  • First Online:
Computation Theory (SCT 1984)

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

Included in the following conference series:

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. R. Danecki, Propositional Dynamic Logic with strong loop predicate, Proc. MFCS'84, LNCS 176, 573–581 (1984) Springer-Verlag

    Google Scholar 

  2. M. J. Fisher, R. E. Ladner, Propositional Dynamic Logic of regular programs, JCSS 18:2, (1979), 194–211

    Google Scholar 

  3. D. Harel, Recurring dominoes: Making the highly undecidable highly understandable, Proc. FCT'83, LNCS 158, 177–194, (1983) Springer-Verlag

    Google Scholar 

  4. M. O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. AMS 141 (1969), 1–35

    Google Scholar 

  5. M. O. Rabin, Weakly definable relations and special automata, in: Math. Logic and Found. of Set Theory (Y. Bar-Hillel ed.) North-Holland (1970), 1–23

    Google Scholar 

  6. R. S. Streett, Propositional Dynamic Logic of looping and converse is elementarily decidable, Inform. & Control 54, 121–141 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Polish Acad. of Sci., Mielżyńskiego 27/29, 61-725, Poznań, Poland

    Ryszard Danecki

Authors
  1. Ryszard Danecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Danecki, R. (1985). Nondeterministic Propositional Dynamic Logic with intersection is decidable. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-16066-3_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16066-3

  • Online ISBN: 978-3-540-39748-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation