Refutation systems for prepositional modal logics
Now we are working on extensions to first order modal logics and to modal logics with intuitionistic basis. A comparison with the work of Wallen [Wal] is planned.
Moreover, we believe that the idea of making more explicit the meaning of the involved necessity operator in connection with the Kripke semantics of the underlying modal logic can be applied to other modal logics (for instance, the logic G of provability) and that this tool is powerful and flexible enough to be applied to every modal logic for which a Kripke semantics exists.
It is clear that if this is true a kind of general uniform technique to obtain efficient complete and correct calculi for different modal logics could be found.
Unable to display preview. Download preview PDF.
- [Boo]Boolos G.-The unprovability of consistency-Cambridge University Press, 1979.Google Scholar
- [Dyc]Dyckhoff R.-Contraction-free sequent calculi for intuitionistic logic-Journal of Symbolic Logic, LVII, 1992, pp. 795–807.Google Scholar
- [Fit]Fitting M.-Intuitionistic Logic, Model Theory and Forcing-North Holland, 1969.Google Scholar
- [Fit1]Fitting M.-A tableau system for propositional S5-Notre Dame Journal of Formal Logic, XVIII, 1977, pp. 292–294.Google Scholar
- [Fit2]Fitting M.-Proof methods for modal and intuitionistic logic-D. Reidel Pu. Co., 1983.Google Scholar
- [Gir]Girle R.-Non-looping tableau for S4-in Basin D., Hähnle R., Franhöfer B., Posegga J., Schwind C. (Eds.) Proceedings of the workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseille, France, April 28–30, 1993, Max-Planck Institut für Informatik, MPI-I-93-213, 1993, pp. 77–88.Google Scholar
- [Grz]Grzegorczyk A.-Some relational systems and the associated topological spaces-Fundamenta mathematicae, LX, 1977, pp. 223–231.Google Scholar
- [Hud]Hudelmaier J.-On contraction free sequent calculus for the modal logic S4-in Broda K., D'Agosdno M., Gorè R., Johnson R., Reeves S. (Eds.) Proceedings of the 3rd workshop on Theorem Proving with Analytic Tableaux and Related Methods, Abingdon U.K., May 4–6, 1994, Imperial College of Science, Technology and Medicine TR-94/5, 1994, pp. 105–112.Google Scholar
- [HC]Hughes G., Cresswell M.-K1.1 is not canonical-Bulletin of the Section of Logic of Polish Academy of Sciences, 11, 1982, pp. 109–113.Google Scholar
- [HC1]Hughes G., Cresswell M.-A Companion to Modal Logic-Methuen & Co., 1984.Google Scholar
- [McK]McKinsey J.-On the syntactical construction of systems of modal logic-Journal of Symbolic Logic, X, 1945, pp. 83–94.Google Scholar
- [MMO1]Miglioli P., Moscato U., Ornaghi M.-How to avoid duplications in refutation systems for intuitionistic and Kuroda logic-in Broda K., D'Agostino M., Gorè R., Johnson R., Reeves S. (Eds.) Proceedings of the 3rd workshop on Theorem Proving with Analytic Tableaux and Related Methods, Abingdon U.K., May 4–6, 1994, Imperial College of Science, Technology and Medicine TR-94/5, 1994, pp. 169–187.Google Scholar
- [Res]Rescher N.-On modal renderings of intuitionistic propositional logic-Notre Dame Journal of Formal Logic, VII, 1966, pp. 277–280.Google Scholar
- [Seg]Segerberg K.-An Essay in Classical Modal Logic — Filosofiska Studier, n. 13, Uppsala, 1971.Google Scholar
- [Sob]Sobocinski B.-Remarks about axiomatization of certain modal systems-Notre ame Journal of Formal Logic, V, 1964, pp. 71–80.Google Scholar
- [Sob1]Sobocinski B.-Family K of the non-Lewis modal systems-Notre Dame Journal of Formal Logic, V, 1964, pp. 313–318.Google Scholar
- [Wal]Wallen L.-Automated Deduction in Nonclassical Logics-MIT Press, 1989.Google Scholar