Determinism and Looping in Combinatory PDL
暂无分享,去创建一个
[1] Rohit Parikh. Propositional Logics of Programs: New Directions , 1983, FCT.
[2] K. Segerberg. A completeness theorem in the modal logic of programs , 1982 .
[3] Tinko Tinchev,et al. PDL with Data Constants , 1985, Inf. Process. Lett..
[4] David Peleg,et al. More on Looping vs. Repeating in Dynamic Logic , 1985, Inf. Process. Lett..
[5] Tinko Tinchev,et al. Quantifiers in combinatory PDL: completeness, definability, incompleteness , 1985, FCT.
[6] David Harel,et al. Looping vs. Repeating in Dynamic Logic , 1982, Inf. Control..
[7] Robert S. Streett. Propositional Dynamic Logic of looping and converse , 1981, STOC '81.
[8] D. Harel. LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER , 1978 .
[9] Richard E. Ladner,et al. Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..
[10] R. Sikorski,et al. The mathematics of metamathematics , 1963 .
[11] David Peleg,et al. Concurrent dynamic logic , 1985, STOC '85.
[12] Robert S. Streett,et al. Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable , 1982, Inf. Control..
[13] Vaughan R. Pratt,et al. Application of modal logic to programming , 1980 .
[14] Mordechai Ben-Ari,et al. Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness , 1982, J. Comput. Syst. Sci..
[15] Daniel Leivant,et al. A Proof Theoretic Methodology for Propositional Dynamic Logic , 1981, ICFPC.