A Completeness Result for a Propositional Dynamic Logic
| dc.contributor.author | Parikh, Rohit | en_US |
| dc.date.accessioned | 2023-03-29T14:10:46Z | |
| dc.date.available | 2023-03-29T14:10:46Z | |
| dc.date.issued | 1978-07 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148934 | |
| dc.description.abstract | Propositional modal logic of programs has been introduced by Fischer and Ladner [1], following ideas of Pratt [4]. We shall call it propositional dynamic logic (PDL) following the terminology of Heral, Meyer and Pratt. In the following we prove the completeness of a rather natural set of axioms for this logic and for an extension of it obtained by allowing the inverse operation which converts a program into its inverse. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-106 | |
| dc.title | A Completeness Result for a Propositional Dynamic Logic | en_US |
| dc.identifier.oclc | 4843571 |
