Skip to main content
SpringerLink
Log in

Deterministic dynamic logic of recursive programs is weaker than dynamic logic

  • 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:

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. Adian S.I. Burnside's Problem and Identities in Groups, Springer Ergebnise der mathematik und ihre Grenzgebiete 95 (1979)

    Google Scholar 

  2. Berman P. Expressive Power in Dynamic Logic and Maze Threading, technical report of Dep. of Comp. Sc., Penn. St. Univ., 1983

    Google Scholar 

  3. Berman P., Halpern J.Y., Tiuryn J. DDL is Weaker Than DL, Proc. of ICALP 1982, Lect. Not. in Comp. Sc., Vol. 140

    Google Scholar 

  4. DDL is weaker than DL, Rept. of Karaganda University, 1981 (in Russian)

    Google Scholar 

  5. S.A. Cook, C.W. Rackoff, Space Lower Bounds for Maze Threadability on Restricted Machines, SIAM J. Comput., Vol. 9, August 1980

    Google Scholar 

  6. Harel D. First-Order dynamic Logic, Lect. Not. in Comp. Sc., Vol. 68

    Google Scholar 

  7. D. Harel, A.R. Meyer and V.R. Pratt Computability and Completeness in Logics of Programs, Proc. of the Ninth STOC, May 1977

    Google Scholar 

  8. D. Harel, A. Pnuelli, J. Stavi, A Complete Axiomatic System for Proving Deductions about Recursive Program, Proc. of The Ninth STOC, May 1977

    Google Scholar 

  9. Pratt, V.R. Semantical consideration on Floyd-Hoare Logic, Proc. of 17th Symp. on Found. of Comp. Sc. Houston, Texas, 1976

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Pennsylvania State University, 6802, University Park, PA, USA

    Piotr Berman

Authors
  1. Piotr Berman
    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

Berman, P. (1983). Deterministic dynamic logic of recursive programs is weaker than dynamic logic. 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_90

Download citation

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

  • 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