Skip to main content
Log in

Labelled Modal Logics: Quantifiers

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

In previous work we gave an approach, based on labelled natural deduction, for formalizing proof systems for a large class of propositional modal logics that includes K, D, T, B, S4, S4.2, KD45, and S5. Here we extend this approach to quantified modal logics, providing formalizations for logics with varying, increasing, decreasing, or constant domains. The result is modular with respect to both properties of the accessibility relation in the Kripke frame and the way domains of individuals change between worlds. Our approach has a modular metatheory too; soundness, completeness and normalization are proved uniformly for every logic in our class. Finally, our work leads to a simple implementation of a modal logic theorem prover in a standard logical framework.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Auffray, Y. and Enjalbert, P., 1992, “Modal theorem proving: An equational viewpoint,” Journal of Logic and Computation 2(3), 247–297.

    Google Scholar 

  • Avron, A., 1991, “Simple consequence relations,” Information and Computation 92, 105–139.

    Google Scholar 

  • Basin, D., Matthews, S., and Viganò, L., 1997a, “Labelled propositional modal logics: Theory and practice,” Journal of Logic and Computation 7 (to appear).

  • Basin, D., Matthews, S., and Viganò, L., 1997b, “A new method for bounding the complexity of modal logics,” in Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory (KGC'97), A. Leitsch, ed., Berlin: Springer-Verlag.

    Google Scholar 

  • Bencivenga, E., 1986, “Free logics,” pp. 373–426 in Handbook of Philosophical Logic, Vol. 3, D.M. Gabbay and F. Guenther, eds., Dordrecht: D. Reidel Publishing Company.

    Google Scholar 

  • Corsi, G. and Ghilardi, S., 1992, “Semantical aspects of quantified modal logic,” pp. 167–195 in Knowledge, Belief and Strategic Interaction, C. Bicchieri and M. Dalla Chiara, eds., Cambridge, New York: Cambridge University Press.

    Google Scholar 

  • Fitting, M., 1983, Proof Methods for Modal and Intuitionistic Logics, Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Fitting, M., 1993, “Basic modal logic,” pp. 365–448 in Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. I, D.M. Gabbay, C.J. Hogger, and J.A. Robinson, eds., Oxford: Clarendon Press.

    Google Scholar 

  • Gabbay, D.M., 1996, Labelled Deductive Systems, Volume 1, Oxford: Clarendon Press.

    Google Scholar 

  • Gabbay, D.M. and Guenthner, F., eds., 1983–1986, Handbook of Philosophical Logic, Dordrecht: D. Reidel Publishing Company.

    Google Scholar 

  • Garson, J., 1984, “Quantification in modal logic,” pp. 249–307 in Handbook of Philosophical Logic, Vol. 2, D.M. Gabbay and F. Guenther, eds., Dordrecht: D. Reidel Publishing Company.

    Google Scholar 

  • Harper, R., Honsell, F., and Plotkin, G., 1993, “A framework for defining logics,” Journal of the ACM 40(1), 143–184.

    Google Scholar 

  • Herzig, A., 1989, “Raisonnement automatique en logique modale et algorithmes d'unification,” PhD Thesis, Université Paul-Sabatier, Toulouse.

    Google Scholar 

  • Hughes, G. and Cresswell, M., 1996, A New Introduction to Modal Logic, London: Routledge.

    Google Scholar 

  • Kripke, S., 1963, “Semantical considerations on modal logics,” Acta Philosophica Fennica 16, 83–94.

    Google Scholar 

  • Nerode, A. and Shore, R., 1993, Logic for Applications, Berlin: Springer-Verlag.

    Google Scholar 

  • Ohlbach, H.J., 1991, “Semantics based translation methods for modal logics,” Journal of Logic and Computation 1(5), 691–746.

    Google Scholar 

  • Paulson, L., 1994, Isabelle: A Generic Theorem Prover, LNCS, Vol. 828, Berlin: Springer-Verlag.

    Google Scholar 

  • Perzanowski, J., 1973, “The deduction theorem for the modal propositional calculi formalized after the manner of Lemmon, Part I,” Reports on Mathematical Logic 1, 1–12.

    Google Scholar 

  • Prawitz, D., 1965, Natural Deduction, A Proof-Theoretical Study, Stockholm: Almqvist and Wiksell.

    Google Scholar 

  • Prawitz, D., 1971, “Ideas and results in proof theory,” pp. 235–307 in Proceedings of the 2nd Scandinavian Logic Symposium, J.E. Fensted, ed., Amsterdam: NorthHolland.

    Google Scholar 

  • Russo, A., 1996, “Modal logics as labelled deductive systems,” PhD Thesis, Department of Computing, Imperial College, London.

    Google Scholar 

  • Shoenfield, J.R., 1967, Mathematical Logic, Reading, MA: Addison Wesley.

    Google Scholar 

  • Simpson, A., 1993, “The proof theory and semantics of intuitionistic modal logic,” PhD Thesis, University of Edinburgh, Edinburgh.

    Google Scholar 

  • Troelstra, A.S. and Schwichtenberg, H., 1996, Basic Proof Theory, Cambridge, NewYork: Cambridge University Press.

    Google Scholar 

  • van Benthem, J., 1984, “Correspondence theory,” pp. 167–248 in Handbook of Philosophical Logic, Vol. 2, D.M. Gabbay and F. Guenther, eds., Dordrecht: D. Reidel Publishing Company.

    Google Scholar 

  • van Benthem, J., 1985, Modal Logic and Classical Logic, Napoli: Bibliopolis.

    Google Scholar 

  • van Dalen, D., 1994, Logic and Structure, Berlin: Springer-Verlag.

    Google Scholar 

  • Wallen, L., 1990, Automated Deduction in Non-Classical Logics, Cambridge, MA: MIT Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Basin, D., Matthews, S. & Viganò, L. Labelled Modal Logics: Quantifiers. Journal of Logic, Language and Information 7, 237–263 (1998). https://doi.org/10.1023/A:1008278803780

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008278803780

Navigation