The Deducibility Problem in Propositional Dynamic Logic
| dc.contributor.author | Meyer, Albert R. | en_US |
| dc.contributor.author | Streett, Robert S. | en_US |
| dc.contributor.author | Mirkowska, Grazina | en_US |
| dc.date.accessioned | 2023-03-29T14:18:28Z | |
| dc.date.available | 2023-03-29T14:18:28Z | |
| dc.date.issued | 1981-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149003 | |
| dc.description.abstract | The problem of whether an arbitrary formula of Propositional Dynamic Logic (PDL) is deducible from a fixed axiom scheme of PDL is _ ]1-complete. Ths contrasts with the decidability of the problem when the axiom scheme is replaced by any single PDL formula. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-192 | |
| dc.title | The Deducibility Problem in Propositional Dynamic Logic | en_US |
| dc.identifier.oclc | 7918141 |
