Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Harel, D. First-Order Dynamic Logic, Lecture Notes in Computer Science, Springer-Verlag, New York, 1979
Meyer, A. Ten Thousand and One Logics of Programming, Bull. of EATCS, N 10,january, 1980
Mirkowska, G. PAL-Propositional Algorithmic Logic, Fundamenta Informaticae, to appear.
Pratt, V. Application of modal logic to programming, Studia Logica, vol. XXXIX 2/3, pp 257–274
Radev, S. Infinitary Propositional Modal Logic and Programming Languages, PhD Thesis, Warsaw University, Institute of Mathema tics,november 1981
Rasiowa, H. Algorithmic Logic, IPI PAN Report No 281, Warsaw, Poland, 1977
Salwicki, A. Formalized algorithmic languages, Bull. de l'Acad. Pol. Sci.-vol. XVIII, 5, 1970, pp 227–232
Segerberg K. Applying modal logic, Studia Logica, vol. XXXIX No 2/3, pp 275–295
Vakarelov, D. Expressibility of some "during" operations in PDL, unpublished manuscript, 1980
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Radev, S.R. (1983). Programming languages and logics of programs. In: Salwicki, A. (eds) Logics of Programs and Their Applications. Logic of Programs 1980. Lecture Notes in Computer Science, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11981-7_18
Download citation
DOI: https://doi.org/10.1007/3-540-11981-7_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11981-4
Online ISBN: 978-3-540-39445-7
eBook Packages: Springer Book Archive