Skip to main content
SpringerLink
Log in

Variants of First-Order Modal Logics

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1847))

Abstract

In this paper we study proof procedures for some variants of first order modal logics, where domains may be either cumulative or freely varying and terms may be either rigid or non-rigid, local or non-local. We define both ground and free variable tableau methods, parametric with respect to the variants of the considered logics. The treatment of each variant is equally simple and is based on the annotation of functional symbols by natural numbers, conveying some semantical information on the worlds where they are meant to be interpreted.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M., Manna, Z.: Modal theorem proving. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol. 230, pp. 172–189. Springer, Heidelberg (1986)

    Google Scholar 

  2. Artosi, A., Benassi, P., Governatori, G., Rotolo, A.: Shakespearian modal logic: A labelled treatment of modal identity. Advances in Modal Logic, 1–21 (1998)

    Google Scholar 

  3. Auffray, Y., Enjalbert, P.: Modal theorem proving: an equational viewpoint. J. of Logic and Computation 2, 247–297 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Baaz, M., Fermüller, C.G.: Non-elementary speedups between different versions of tableaux. In: Baumgartner, P., Posegga, J., Hähnle, R. (eds.) TABLEAUX 1995. LNCS, vol. 918, pp. 217–230. Springer, Heidelberg (1995)

    Google Scholar 

  5. Basin, D., Matthews, M., Viganò, L.: Labelled modal logics: Quantifiers. J. of Logic, Language and Information 7(3), 237–263 (1998)

    Article  MATH  Google Scholar 

  6. Beckert, B., Hähnle, R., Schmitt, P.H.: The even more liberalized δ-rule in free variable semantic tableaux. In: Mundici, D., Gottlob, G., Leitsch, A. (eds.) KGC 1993. LNCS, vol. 713, pp. 108–119. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  7. Cialdea, M.: Resolution for some first order modal systems. Theoretical Computer Science 85, 213–229 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cialdea, M., Fariñas del Cerro, L.: A modal Herbrand’s property. Z. Math. Logik Grundlag. Math. 32, 523–539 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fitting, M.: Proof Methods for Modal and Intuitionistic Logics. Reidel Publ. Co., Dordrechtz (1983)

    MATH  Google Scholar 

  10. Fitting, M.: First-order modal tableaux. J. of Automated Reasoning 4, 191–213 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fitting, M.: On quantified modal logic. Fundamenta Informaticae 39, 105–121 (1999)

    MATH  MathSciNet  Google Scholar 

  12. Garson, J.W.: Quantification in modal logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. II, pp. 249–307. Reidel Publ. Co., Dordrechtz (1984)

    Google Scholar 

  13. Goré, R.: Tableau methods for modal and temporal logics. In: D’Agostino, M., Gabbay, G., Hähnle, R., Posegga, J. (eds.) Handbook of tableau methods. Kluwer, Dordrecht (1999)

    Google Scholar 

  14. Hähnle, R., Schmitt, P.H.: The liberalized δ-rule in free variable semantic tableaux. J. of Automated Reasoning 13, 211–222 (1994)

    Article  MATH  Google Scholar 

  15. Jackson, P., Reichgelt, H.: A general proof method for first-order modal logic. In: IJCAI 1987, pp. 942–944. Morgan Kaufmann, San Francisco (1987)

    Google Scholar 

  16. Konolige, K.: Resolution and quantified epistemic logics. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol. 230, pp. 199–208. Springer, Heidelberg (1986)

    Google Scholar 

  17. Mints, G.: Indexed systems of sequents and cut-elimination. J. of Philosophical Logic 26, 671–696 (1997)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  19. Wallen, L.A.: Automated Deduction in Nonclassical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics. MIT Press, Cambridge (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Automazione, Università Roma Tre,  

    Marta Cialdea Mayer

  2. L.R.I., Université de Paris-Sud,  

    Serenella Cerrito

Authors
  1. Marta Cialdea Mayer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serenella Cerrito
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of St Andrews, Scotland

    Roy Dyckhoff

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cialdea Mayer, M., Cerrito, S. (2000). Variants of First-Order Modal Logics. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_16

Download citation

  • DOI: https://doi.org/10.1007/10722086_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67697-3

  • Online ISBN: 978-3-540-45008-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation