Skip to main content

Labelled Deduction for the Guarded Fragment

  • Chapter
Labelled Deduction

Part of the book series: Applied Logic Series ((APLS,volume 17))

Abstract

We present the tableau calculus LC 2-TAB which is sound and complete with respect to local square modal logic. The system is a labelled deduction calculus in the spirit of those for modal S5. The novelty here is that the calculus works in two interacting dimensions. This 2-dimensional modal logic allows one to simulate different other modal logics, like K, KT, KTB or multi-K in quite an elegant way. The calculus is also strong enough to decide an interesting PSPACE complete sub-fragment of the guarded fragment, which is generally conceived of as the true modal fragment of first order logic. A PROLOG implementation of this calculus is available through the WWW.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. H. Andréka, I. Hodkinson, and I. Németi. Finite algebras of relations are representable on finite sets. Journal of Symbolic Logic, 64(1):243–267, 1999.

    Article  Google Scholar 

  2. H. Andréka, J. van Benthem, and I. Németi. Back and forth between modal logic and classical logic. Bulletin of the Interest Group in Pure and Applied Logics, 3(3):685–720, 1995.

    Google Scholar 

  3. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27(3):217–274, 1998.

    Article  Google Scholar 

  4. C. Areces, P. Blackburn, and M. Marx. Hybrid logics. Characterization, interpolation and complexity. Technical report, Institute for Logic, Language and Computation, University of Amsterdam, 1999.

    Google Scholar 

  5. P. Blackburn and J. Seligman. Hybrid languages. Journal of Logic, Language and Information, 4(3):251–272,1995.

    Article  Google Scholar 

  6. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer Verlag, 1997.

    Book  Google Scholar 

  7. M. Fitting. First Order Logic and Automated Theorem Proving. Springer Verlag, 1990.

    Book  Google Scholar 

  8. D.M. Gabbay. Expressive functional completeness in tense logic. In U. Mönnich, editor, Aspects of Philosophical Logic, pages 91–117. D. Reidel Publishing Company, 1981.

    Chapter  Google Scholar 

  9. J.Y. Halpern and Y.O. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319–379, 1992.

    Article  Google Scholar 

  10. R. Hirsch, I. Hodkinson, M. Marx, Sz Mikulás, and M. Reynolds. Mosaics and step—by—step. Remarks on “A modal logic of relations”. In E. Orlowska, editor, Logic at Work. Essays Dedicated to the Memory of Elena Rasiowa,Studies in Fuzziness and Soft Computing, pages 158–167. Springer Verlag, Berlin/Heidelberg, 1999.

    Google Scholar 

  11. R. Maddux. The equational theory of CA3 is undecidable. Journal of Symbolic Logic, 45(2):311–316,1980.

    Article  Google Scholar 

  12. M. Marx. Complexity of modal logics of relations. Technical Report ML-97–02, Institute for Logic, Language and Computation, University of Amsterdam, May 1997.

    Google Scholar 

  13. M. Marx. Complexity of products of modal logics.Jour-nal of Logic and Computation, 9(2):221–238, 1999. See http://www.oup.co.uk/logcom/hdbNolume09/Issue02

    Google Scholar 

  14. M. Marx, S. Mikulás, and S. Schlobach. A tableau calculus for a local cubic modal logic and it’s implementation. Technical report, King’s College, Department of Computer Science, London., 1999.

    Google Scholar 

  15. M. Marx and Y. Venema. Multi-dimensional Modal Logic. Applied Logic Series. Kluwer Academic Publishers, 1997.

    Google Scholar 

  16. E. Spaan. Complexity of modal logics. PhD thesis, University of Amsterdam, Institute for Logic, Language and Computation, 1993.

    Google Scholar 

  17. J. van Benthem. Exploring Logical Dynamics. Studies in Logic, Language and Information CSLI Publications, Stanford, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Marx, M., Mikulás, S., Schlobach, S. (2000). Labelled Deduction for the Guarded Fragment. In: Basin, D., D’Agostino, M., Gabbay, D.M., Matthews, S., Viganò, L. (eds) Labelled Deduction. Applied Logic Series, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4040-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-4040-9_8

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5781-3

  • Online ISBN: 978-94-011-4040-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics