Deterministic dynamic logic of recursive programs is weaker than dynamic logic

  • Piotr Berman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


Finite Automaton Dynamic Logic Recursive Program Initial Valuation Auxiliary Computation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    Adian S.I. Burnside's Problem and Identities in Groups, Springer Ergebnise der mathematik und ihre Grenzgebiete 95 (1979)Google Scholar
  2. [B]
    Berman P. Expressive Power in Dynamic Logic and Maze Threading, technical report of Dep. of Comp. Sc., Penn. St. Univ., 1983Google Scholar
  3. [BHT]
    Berman P., Halpern J.Y., Tiuryn J. DDL is Weaker Than DL, Proc. of ICALP 1982, Lect. Not. in Comp. Sc., Vol. 140Google Scholar
  4. [BRT]
    DDL is weaker than DL, Rept. of Karaganda University, 1981 (in Russian)Google Scholar
  5. [CR]
    S.A. Cook, C.W. Rackoff, Space Lower Bounds for Maze Threadability on Restricted Machines, SIAM J. Comput., Vol. 9, August 1980Google Scholar
  6. [H]
    Harel D. First-Order dynamic Logic, Lect. Not. in Comp. Sc., Vol. 68Google Scholar
  7. [HMP]
    D. Harel, A.R. Meyer and V.R. Pratt Computability and Completeness in Logics of Programs, Proc. of the Ninth STOC, May 1977Google Scholar
  8. [HPS]
    D. Harel, A. Pnuelli, J. Stavi, A Complete Axiomatic System for Proving Deductions about Recursive Program, Proc. of The Ninth STOC, May 1977Google Scholar
  9. [P]
    Pratt, V.R. Semantical consideration on Floyd-Hoare Logic, Proc. of 17th Symp. on Found. of Comp. Sc. Houston, Texas, 1976Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Piotr Berman
    • 1
  1. 1.Department of Computer SciencePennsylvania State UniversityUniversity ParkUSA

Personalised recommendations