A Decidability Result for a Second Order Process Logic
| dc.contributor.author | Parikh, Rohit | en_US |
| dc.date.accessioned | 2023-03-29T14:11:09Z | |
| dc.date.available | 2023-03-29T14:11:09Z | |
| dc.date.issued | 1978-09 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148940 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-112 | |
| dc.title | A Decidability Result for a Second Order Process Logic | en_US |
| dc.identifier.oclc | 4846908 |
