The deducibility problem in propositional dynamic logic
The problem of whether an arbitrary formula of Propositional Dynamic Logic (PDL) is deducible from a fixed axiom scheme of PDL is Π 1 1 -complete. This contrasts with the decidability of the problem when the axiom scheme is replaced by any single PDL formula.
KeywordsPropositional Logic Atomic Proposition Program Scheme Axiom Scheme Propositional Dynamic Logic
Unable to display preview. Download preview PDF.
- 1.Fischer, M. J. and R. E. Ladner, "Propositional Dynamic Logic of Regular Programs", JCSS, 18, 194–211, 1979.Google Scholar
- 2.Mirkowska, G., "Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations", Proceedings of the 12th ACM Symposium on Theory of Computing, 14–21, 1980.Google Scholar
- 3.Mirkowska, G., personal communication. Warsaw, July, 1980.Google Scholar
- 4.Pratt, V. R., "Models of Program Logics", JCSS, 20, 231–254, 1980.Google Scholar
- 5.Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Company, 1967.Google Scholar
- 6.Shoenfield, J. R., Mathematical Logic, Addison-Wesley Publishing Company, 1967.Google Scholar
- 7.Streett, R. S., "Propositional Dynamic Logic of Looping and Converse", Proceedings of the 13th ACM Symposium on Theory of Computing, 1981.Google Scholar