Skip to main content
SpringerLink
Log in

Proof Search in Nested Sequent Calculi

  • Conference paper
  • First Online:
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9450))

Included in the following conference series:

Abstract

We propose a notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the corresponding sequent calculi. The resulting systems are amenable to specifications in linear logic. Examples include modal logic \(\mathsf {K}\), a simply dependent bimodal logic and the standard non-normal modal logics. As byproduct we obtain the first nested sequent calculi for the considered non-normal modal logics.

B. Lellmann—Funded by the EU under Marie Skłodowska-Curie grant agreement No. 660047.

E. Pimentel—Funded by CNPq.

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 EPUB and 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

References

  1. Andreoli, J.M.: Logic programming with focusing proofs in linear logic. J. Logic Comput. 2(3), 297–347 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brünnler, K.: Deep sequent systems for modal logic. Arch. Math. Log. 48, 551–577 (2009)

    Article  MATH  Google Scholar 

  3. Chaudhuri, K., Guenot, N., Straßburger, L.: The focused calculus of structures. In: Bezem, M. (ed.) CSL 2011, pp. 159–173. Leibniz International Proceedings in Informatics (2011)

    Google Scholar 

  4. Chellas, B.F.: Modal Logic. Cambridge University Press, Cambridge (1980)

    Book  MATH  Google Scholar 

  5. Demri, S.: Complexity of simple dependent bimodal logics. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847, pp. 190–204. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Goré, R., Ramanayake, R.: Labelled tree sequents, tree hypersequents and nested (deep) sequents. In: AiML, vol. 9, pp. 279–299 (2012)

    Google Scholar 

  7. Guglielmi, A., Straßburger, L.: Non-commutativity and MELL in the calculus of structures. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 54–68. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Lavendhomme, R., Lucas, T.: Sequent calculi and decision procedures for weak modal systems. Studia Logica 65, 121–145 (2000)

    Article  MathSciNet  Google Scholar 

  9. Lellmann, B.: Linear nested sequents, 2-sequents and hypersequents. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 135–150. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  10. Lellmann, B., Pattinson, D.: Constructing cut free sequent systems with context restrictions based on classical or intuitionistic logic. In: Lodaya, K. (ed.) ICLA 2013. LNCS (LNAI), vol. 7750, pp. 148–160. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Masini, A.: 2-sequent calculus: a proof theory of modalities. Ann. Pure Appl. Logic 58, 229–246 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  12. Mendler, M., Scheele, S.: Cut-free Gentzen calculus for multimodal CK. Inf. Comput. (IANDC) 209, 1465–1490 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  13. Miller, D., Pimentel, E.: A formal framework for specifying sequent calculus proof systems. Theor. Comput. Sci. 474, 98–116 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  14. Negri, S., van Plato, J.: Proof Analysis: A Contribution to Hilbert’s Last Problem. Cambridge University Press, Cambridge (2011)

    Book  Google Scholar 

  15. Nigam, V., Miller, D.: A framework for proof systems. J. Autom. Reasoning 45(2), 157–188 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  16. Nigam, V., Pimentel, E., Reis, G.: An extended framework for specifying and reasoning about proof systems. J. Logic Comput. (2014). doi:10.1093/logcom/exu029, http://logcom.oxfordjournals.org/content/early/2014/06/06/logcom.exu029.abstract

  17. Poggiolesi, F.: The method of tree-hypersequents for modal propositional logic. In: Makinson, D., Malinowski, J., Wansing, H. (eds.) Towards Mathematical Philosophy. Trends in Logic, vol. 28, pp. 31–51. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Straßburger, L.: Cut elimination in nested sequents for intuitionistic modal logics. In: Pfenning, F. (ed.) FOSSACS 2013. LNCS, vol. 7794, pp. 209–224. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Languages, TU Wien, Vienna, Austria

    Björn Lellmann

  2. Departamento de Matemática, UFRN, Natal, Brazil

    Elaine Pimentel

Authors
  1. Björn Lellmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elaine Pimentel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Björn Lellmann .

Editor information

Editors and Affiliations

  1. New York University, New York, New York, USA

    Martin Davis

  2. University of the South Pacific, Suva, Fiji

    Ansgar Fehnker

  3. Macquarie University, Sydney, New South Wales, Australia

    Annabelle McIver

  4. The University of Manchester, Manchester, United Kingdom

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lellmann, B., Pimentel, E. (2015). Proof Search in Nested Sequent Calculi. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2015. Lecture Notes in Computer Science(), vol 9450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48899-7_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48899-7_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48898-0

  • Online ISBN: 978-3-662-48899-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation