A Decidability Result for a Second Order Process Logic
Author(s)
Parikh, Rohit
DownloadMIT-LCS-TM-112.pdf (3.905Mb)
Metadata
Show full item recordAbstract
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.
Date issued
1978-09Series/Report no.
MIT-LCS-TM-112