Oct. 16, 1978 to Oct. 18, 1978
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1978.2
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.
Rohit Parikh, "A decidability result for a second order process logic", FOCS, 1978, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1978, pp. 177-183, doi:10.1109/SFCS.1978.2