Propositional Dynamic Logic in Two- and More Dimensions

Assen Petkov
Additional contact information
Assen Petkov: State Committee for Research and Technologies, Inform. Comp. Centre

A chapter in Mathematical Logic and Its Applications, 1987, pp 323-329 from Springer

Abstract: 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.

Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_24

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_24

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().