Abstract
We investigate sequent calculi for the weak modal (propositional) system reduced to the equivalence rule and extensions of it up to the full Kripke system containing monotonicity, conjunction and necessitation rules. The calculi have cut elimination and we concentrate on the inversion of rules to give in each case an effective procedure which for every sequent either furnishes a proof or a finite countermodel of it. Applications to the cardinality of countermodels, the inversion of rules and the derivability of Löb rules are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chellas, B. F., Modal Logic. An Introduction, Cambridge University Press, Cambridge, 1980.
CrabbÉ, M., ‘Deux redondances de la règle de Löb en logique modale', Logique et Analyse 133–134 (1991), 15-22.
Fitting, M., Proof Methods for Modal and Intuitionistic Logic, Reidel, Dordrecht. 1983.
Gentzen, G, ‘Investigations into logical deduction', in: M. E. Szabo, The collected papers of Gerhard Gentzen, North-Holland, Amsterdam, London, pages 68-131, 1969.
GorÉ, R. P., ‘Tableau methods for modal and temporal logics', in M. D'Agostino, D. Gabbay, R. Hähnle, J. Posegga (eds.). Handbook of Tableau Methods, Chapter 6, Kluwer Academic Publishers, Dordrecht, pages 297-396, 1999.
Lavendhomme, R., and Th. Lucas, ‘From logical omniscience to partial logical competence', in Bacharach, Gérard-Varet, Mongin and Shin (eds.), Epistemic Logic and the Theory of Games and Decisions, Kluwer A. P., Dordrecht, pages 107-128, 1997.
Lucas, Th., ‘Modalité monotone et schéma T’, Logique et Analyse 133–134 (1991). 151-158.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lavendhomme, R., Lucas, T. Sequent Calculi and Decision Procedures for Weak Modal Systems. Studia Logica 66, 121–145 (2000). https://doi.org/10.1023/A:1026753129680
Issue Date:
DOI: https://doi.org/10.1023/A:1026753129680