A Decidability Result for a Second Order Process Logic
Name
MIT-LCS-TM-112.pdf
Size
3.91 MB
Format
Adobe PDF
Checksum (MD5)
09750155ba7ceaee6f347723ea23ef55
Author(s)
Parikh, Rohit
Date Issued
September 1978
Series/Report no.
MIT-LCS-TM-112
Abstract
We prove the decidability of the validity problem for a rather general language for talking about computations. As corollaries of our result, we obtain some decidability results of Pratt, Constable, Fischer-Ladner, and Pnueli and also a new decidability result for deterministic propositional dynamic logic.
Persistent DSpace Link