The Deducibility Problem in Propositional Dynamic Logic

Author(s)
Meyer, Albert R.; Streett, Robert S.; Mirkowska, Grazina
Thumbnail
DownloadMIT-LCS-TM-192.pdf (3.156Mb)
Metadata
Show full item record
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.
Date issued
1981-02
URI
https://hdl.handle.net/1721.1/149003
Series/Report no.
MIT-LCS-TM-192
Collections