论文信息 - The Deducibility Problem in Propositional Dynamic Logic

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.

Albert R. Meyer | Grazyna Mirkowska | Robert S. Streett

[1] Richard E. Ladner,et al. Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[2] Vaughan R. Pratt,et al. A Near-Optimal Method for Reasoning about Action , 1980, J. Comput. Syst. Sci..

[3] Robert S. Streett. Propositional Dynamic Logic of looping and converse , 1981, STOC '81.

[4] Joseph R. Shoenfield,et al. Mathematical logic , 1967 .

[5] Vaughan R. Pratt,et al. Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[7] Grazyna Mirkowska,et al. Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations , 1980, STOC '80.