Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness
Name
MIT-LCS-TM-190.pdf
Size
4.57 MB
Format
Adobe PDF
Checksum (MD5)
49ce46d9fab9df7f68f0d920817c60b2
Author(s)
Ben-Ari, Mordechai
Halpern, Joseph Y.
Pnueli, Amir
Date Issued
January 1981
Series/Report no.
MIT-LCS-TM-190
Abstract
Let p be a formular in deterministic propositional dynamic logic. A decision procedure for the satisfiability of p is given along with a construction of a finite model for every satisifiable p. The decision procedure runs in deterministic time 2^cn and the size of the model is bounded by n^2 * 4^n, where n is the lenth of p. Finally, a complete axiomatization for deterministic propositional dynamic logic is given, based on the Segerberg axioms for propositional dynamic logic.
Persistent DSpace Link
