Programming languages and logics of programs

  • S. R. Radev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 148)


We prove the completeness theorem for a class of logics of programs. As corollaries of our result, we obtain the completeness theorem for a large class of extensions of PDL.


Modal Logic Propositional Variable Completeness Theorem Program Part Algorithmic Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Harel, D. First-Order Dynamic Logic, Lecture Notes in Computer Science, Springer-Verlag, New York, 1979Google Scholar
  2. [2]
    Meyer, A. Ten Thousand and One Logics of Programming, Bull. of EATCS, N 10,january, 1980Google Scholar
  3. [3]
    Mirkowska, G. PAL-Propositional Algorithmic Logic, Fundamenta Informaticae, to appear.Google Scholar
  4. [4]
    Pratt, V. Application of modal logic to programming, Studia Logica, vol. XXXIX 2/3, pp 257–274Google Scholar
  5. [5]
    Radev, S. Infinitary Propositional Modal Logic and Programming Languages, PhD Thesis, Warsaw University, Institute of Mathema tics,november 1981Google Scholar
  6. [6]
    Rasiowa, H. Algorithmic Logic, IPI PAN Report No 281, Warsaw, Poland, 1977Google Scholar
  7. [7]
    Salwicki, A. Formalized algorithmic languages, Bull. de l'Acad. Pol. Sci.-vol. XVIII, 5, 1970, pp 227–232Google Scholar
  8. [8]
    Segerberg K. Applying modal logic, Studia Logica, vol. XXXIX No 2/3, pp 275–295Google Scholar
  9. [9]
    Vakarelov, D. Expressibility of some "during" operations in PDL, unpublished manuscript, 1980Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • S. R. Radev
    • 1
  1. 1.Warsaw UniversityWarsawPoland

Personalised recommendations