Rewrite rule systems for modal propositional logic
- 29 February 1992
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 12 (3) , 281-298
- https://doi.org/10.1016/0743-1066(92)90028-2
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977
- Some theorems about the sentential calculi of Lewis and HeytingThe Journal of Symbolic Logic, 1948