Dynamic Logic as a Uniform Framework for Theorem Proving in Intensional Logic

Dynamic logic is proposed as a uniform framewok for theorem proving in propositional intensional logic. Satisfiability and unsatisfiability preserving translations from various modal, deontic, epistemic, temporal, and intuitionistic calculi into dynamic logic calculi are defined and partly proved to be correct. The translations unify theorem proving in intensional logic by using dynamic logic as an intermediate logic for which the actual theorem provers can be implemented.

[1]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

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

[3]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

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

[6]  Brian F. Chellas Modal Logic: Normal systems of modal logic , 1980 .

[7]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[8]  Joseph Y. Halpern,et al.  A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft , 1985, IJCAI.

[9]  D. Gabbay,et al.  Handbook of Philosophical Logic, Volume II. Extensions of Classical Logic , 1986 .

[10]  Rohit Parikh,et al.  Logics of Knowledge, Games and Dynamic Logic , 1984, FSTTCS.

[11]  Mordechai Ben-Ari,et al.  Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness , 1982, J. Comput. Syst. Sci..

[12]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[13]  Joseph Y. Halpern,et al.  The prepositional dynamic logic of deterministic, well-structured programs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[14]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[15]  Pierre Wolper,et al.  A temporal logic for reasoning about partially ordered computations (Extended Abstract) , 1984, PODC '84.

[16]  Jai Srinivasan,et al.  Branching time temporal logic , 1988, REX Workshop.