An Arithmetical Hierarchy in Propositional Dynamic Logic
暂无分享,去创建一个
[1] Francine Berman,et al. Propositional Dynamic Logic is Weaker without Tests , 1981, Theor. Comput. Sci..
[2] A. Meyer,et al. Bisimulation can't be traced. Preliminary report , 1987 .
[3] Vaughan R. Pratt,et al. SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.
[4] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[5] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[6] Richard E. Ladner,et al. Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..
[7] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.
[8] Peter C. Chapin. Formal languages I , 1973, CSC '73.