19th Annual Symposium on Foundations of Computer Science (sfcs 1978) (1978)
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.
R. Parikh, "A decidability result for a second order process logic," 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)(FOCS), vol. 00, no. , pp. 177-183, 1978.