论文信息 - Rewrite Rule Systems for Modal Propositional Logic - 字舞流文

Rewrite Rule Systems for Modal Propositional Logic

The aim of this paper is to explain our new results relating modal propositional logic and rewrite rule systems. More precisely, we give complete term rewriting systems for the modal propositional systems known as K,Q,T and S5.

Annie Foret | Annie Foret

[1] J. N. Crossley,et al. Formal Systems and Recursive Functions , 1963 .

[2] Jieh Hsiang,et al. Topics in Automated Theorem Proving and Program Generation , 1983 .

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

[4] Alfred Tarski,et al. Some theorems about the sentential calculi of Lewis and Heyting , 1948, The Journal of Symbolic Logic.

[5] Saul A. Kripke,et al. Semantical Analysis of Intuitionistic Logic I , 1965 .

[6] Max J. Cresswell,et al. A companion to modal logic , 1984 .

[7] Pierre Lescanne,et al. Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation , 1987, Sci. Comput. Program..

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

[9] D. Gabbay. Semantical investigations in Heyting's intuitionistic logic , 1981 .

[10] R. Sikorski,et al. The mathematics of metamathematics , 1963 .

[11] Joseph Jay Zeman. Modal logic: The Lewis-modal systems, , 1973 .

[12] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .

[13] Patrice Enjalbert,et al. Modal Resolution in Clausal Form , 1989, Theor. Comput. Sci..