|Title:||An Array Assignment for Propositional Dynamic Logic
|Authors:||J.A. Makowsky and M.L. Tiomkin
|Abstract:||We propose an extension of propositional dynamic logic which allows a propositional version of an array assignments. In this logic many notions like equivalence of programs, looping and finitely branching are expressible on a propositional level. In fact we show that the resulting logic is equivalent in expressive power to first order logic augmented by a device to expressive transitive closures. In other words, it is (modulo extra predicate symbols) equivalent to first order dynamic logic. Not surprisingly, therefore, the validity problem for this extension is TIl-complete.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1982/CS/CS0234), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1982
To the main CS technical reports page
Computer science department, Technion