We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

The Deducibility Problem in Propositional Dynamic Logic

Thumbnail Image
Download
Name

MIT-LCS-TM-192.pdf

Size

3.16 MB

Format

Adobe PDF

Checksum (MD5)

1d58d6aa6fa0a9767ffad63fce87a94f

Author(s)
Meyer, Albert R.
•
Streett, Robert S.
•
Mirkowska, Grazina
Date Issued
February 1981
Series/Report no.
MIT-LCS-TM-192
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.