Abstract
The Propositional Dynamic Logic PDL extends the Kripke modal logic with the intension to frame the behavior and formalize the properties of computer programs. A program α(as a rule non-deterministic) and a property A are interpreted respectively as a binary relation R(α) and a subset V(A) of some presupposed universe U={u, v, …}. Its elements are refered to as possible worlds or memory states and are traditionally regarded as some indivisible units. The aim of this paper is to suggest a reliable framework and to establish some basic results for that case, where the memory states have themselves been divided and granted the structure of ordered pairs (or generally, ordered N-tuples). In this case, formally R(α) and V(A) will be quaternary and binary relations, respectively. Informally this corresponds to the case of computation with two-cell memory device.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Passy S., Tinchev T., PDL with Data Constants, Inf. Proc. Letters, 20(1985), 35–41.
Passy S., Tinchev T., Quantifiers in Combinatory PDL: completeness, definability, incompleteness, Proc. FCT′ 85, Springer LNCS 199, 512–519.
Segerberg Kr., Two-dimensional Modal Logic, Journal of Philosophical Logic, 2(1973), 76–96.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Plenum Press, New York
About this chapter
Cite this chapter
Petkov, A. (1987). Propositional Dynamic Logic in Two- and More Dimensions. In: Skordev, D.G. (eds) Mathematical Logic and Its Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0897-3_24
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0897-3_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8234-1
Online ISBN: 978-1-4613-0897-3
eBook Packages: Springer Book Archive