Article PDF
References
Goldblatt, R. (1982). Axiomatising the logic of computer prorgamming. Lecture Notes in Computer Science (Vol. 130). Berlin: Springer.
Goldblatt, R. (1987). Logics of time and computation. CSLI Lecture Notes (Vol. 7). Stanford, CA: CSLI Publications (2nd ed., revised and expanded, 1992).
Goldblatt, R. (1993). Mathematics of modality. CSLI Lecture Notes (Vol. 43). Stanford, CA: CSLI Publications.
Mirkowska, G. (1981). PAL—Propositional algorithmic logic. In E. Engeler (Ed.), Logic of Programs. Lecture Notes in Computer Science (Vol. 125, pp. 23–101). Berlin: Springer.
Renardel de Lavalette G.R., Kooi B., Verbrugge R. (2008) Strong completeness and limited canonicity for PDL. Journal of Logic, Language and Information 17: 69–87
Segerberg K. (1994) A model existence program in infinitary propositional modal logic. Journal of Philosophical Logic 23: 337–367
Author information
Authors and Affiliations
Corresponding author
Additional information
The online version of the original article can be found under doi:10.1007/s10849-007-9051-4.
Rights and permissions
About this article
Cite this article
Renardel de Lavalette, G., Kooi, B. & Verbrugge, R. Strong Completeness and Limited Canonicity for PDL . J of Log Lang and Inf 18, 291–292 (2009). https://doi.org/10.1007/s10849-009-9083-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10849-009-9083-z