Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1989: STACS 89 pp 536Cite as

Examining the satisfiability of the formulas of Propositional Dynamic Logic

  • Systems
  • Conference paper
  • First Online:

  • 140 Accesses

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

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

Bibliography

  • R. Sherman, D. Havel: “A combined Proof of One-Exponential Decidability and Completeness for Proportional Dynamic Logic” Report on the 1st GTI workshop, Paderborn

    Google Scholar 

  • D. Havel: “First order dynamic logic” LNCS vol. 68, Springer Verlag, New York 1979

    Google Scholar 

  • D. Havel “Dynamic Logic” Handbook of philosophical logic, vol. 2, chap 2/10.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gdańsk University, Poland

    Tomasz Janowski

Authors
  1. Tomasz Janowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien R. Cori

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janowski, T. (1989). Examining the satisfiability of the formulas of Propositional Dynamic Logic. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029016

Download citation

  • DOI: https://doi.org/10.1007/BFb0029016

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation