Abstract
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.
These systems are presented as extensions of Hsiang's system for classical propositional calculus [7].
We have checked local confluence with the rewrite rule system K.B. developped by the Formel project at INRIA[2,4]. We prove that these systems are noetherian, and then infer their confluence from Newman's lemma.
Therefore each term rewriting system provides a new automated decision procedure and defines a canonical form for the corresponding logic. We also show how to characterize the canonical forms thus obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Enjalbert et L. Farinas Del Cerro. 1986 Modal Resolution In Clausal Form. Greco de programation du C.N.R.S.
F.Fages. 1984 Le système KB Présentation et Bibliographie, mise en oeuvre Rapport INRIA, France.
D.M. Gabbay. 1981 Semantical Investigations in Heyting's Intuitionnistic Logic. Dordrecht, Reidel.
G.Huet and D. Oppen. January 1980 Equations and Rewrite Rules:a survey. Technical Report 15, Stanford Verification Group.
G.E. Hughes et M.J. Cresswell. 1968 An Introduction to Modal Logic. Methuen & Co., London.
G.E. Hughes et M.J. Cresswell. 1984 A Companion to Modal Logic. Methuen & Co., London.
J.Hsiang Nov. 1982 Topics in Automated Theorem Proving and Program Generation. Ph.D. Thesis, Univ.of Illinois at Urbana-Champaign.
J.C.C. McKinsey and A. Tarski 1948 Some Theorems about the Sentential Calculi of Lewis and heyting. JSL Vol. 13 pp. 1–15.
S.A. Kripke. 1974 Semantical analysis of intuitionistic logic I. Formal systems and recusive functions, ed. J.N. Crossley and M.A.E. Dummett p.92–130, North Holland, Amsterdam.
R.E. Ladner. 1977 The computational complexity of provability in systems of modal propositional logic SIAM J. C. 6 (3)
H. Rasiowa et R. Sikorsi. 1968 The Mathematics of Metamathematics. Warszowa.
H. Rasiowa. 1974 An Algebraic Approach To Non-Classical Logics. North-Holland, Amsterdam.
J.J. Zeman. Modal Logic: The Lewis-Modal Systems. Clarendon Press, Oxford.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Akademie-Verlag Berlin
About this paper
Cite this paper
Foret, A. (1988). Rewrite rule systems for modal propositional logic. In: Grabowski, J., Lescanne, P., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1988. Lecture Notes in Computer Science, vol 343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50667-5_66
Download citation
DOI: https://doi.org/10.1007/3-540-50667-5_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50667-6
Online ISBN: 978-3-540-46063-3
eBook Packages: Springer Book Archive