Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

TABLEAUX 2019: Automated Reasoning with Analytic Tableaux and Related Methods pp 94–110Cite as

Bounded Sequent Calculi for Non-classical Logics via Hypersequents

  • Conference paper
  • First Online:

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

Abstract

Using substructural and modal logics as case studies, a uniform method is presented for transforming cut-free hypersequent proofs into sequent calculus proofs satisfying relaxations of the subformula property. As a corollary we prove decidability for a large class of commutative substructural logics with contraction and mingle, and get a simple syntactic proof of a well known result: the sequent calculus for \(\mathbf {S5}\) is analytic.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Avron, A.: A constructive analysis of RM. J. Symbol. Logic 52(4), 939–951 (1987)

    Article  MathSciNet  Google Scholar 

  2. Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell. 4(3–4), 225–248 (1991)

    Article  MathSciNet  Google Scholar 

  3. Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Logic: From Foundations to Applications (Staffordshire, 1993), pp. 1–32. Oxford Sci. Publ., Oxford Univ. Press, New York (1996)

    Google Scholar 

  4. Bezhanishvili, N., Ghilardi, S.: The bounded proof property via step algebras and step frames. Ann. Pure Appl. Logic 165(12), 1832–1863 (2014)

    Article  MathSciNet  Google Scholar 

  5. Bezhanishvili, N., Ghilardi, S., Lauridsen, F.M.: One-step heyting algebras and hypersequent calculi with the bounded proof property. J. Logic Comput. 27(7), 2135–2169 (2016)

    MathSciNet  MATH  Google Scholar 

  6. Ciabattoni, A., Galatos, N., Terui, K.: From axioms to analytic rules in nonclassical logics. LICS 2008, 229–240 (2008)

    Google Scholar 

  7. Fitting, M.: Subformula results in some propositional modal logics. Studia Logica 37(4), 387–391 (1979), (1978)

    Article  MathSciNet  Google Scholar 

  8. Galatos, N., Jipsen, P., Kowalski, T., Ono, H.: Residuated lattices: analgebraic glimpse at substructural logics. Studies in Logic and the Foundations of Mathematics, vol. 151. Elsevier (2007)

    Google Scholar 

  9. Horcík, R., Terui, K.: Disjunction property and complexity of substructural logics. Theor. Comput. Sci. 412(31), 3992–4006 (2011)

    Article  MathSciNet  Google Scholar 

  10. Hori, R., Ono, H., Schellinx, H.: Extending intuitionistic linear logic with knotted structural rules. Notre Dame J. Formal Logic‘ 35(2), 219–242 (1994)

    Article  MathSciNet  Google Scholar 

  11. Kamide, N.: Substructural logics with mingle. J. Logic Lang. Inform. 11(2), 227–249 (2002)

    Article  MathSciNet  Google Scholar 

  12. Kowalski, T., Ono, H.: Analytic cut and interpolation for bi-intuitionistic logic. Rev. Symbolic Logic 10(2), 259–283 (2017)

    Article  MathSciNet  Google Scholar 

  13. Kurokawa, H.: Hypersequent calculi for modal logics extending S4. In: Nakano, Y., Satoh, K., Bekki, D. (eds.) JSAI-isAI 2013. LNCS (LNAI), vol. 8417, pp. 51–68. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10061-6_4

    Chapter  Google Scholar 

  14. Lahav, O.: From frame properties to hypersequent rules in modal logics. In: LICS 2013, IEEE. pp. 408–417 (2013)

    Google Scholar 

  15. Lahav, O., Zohar, Y.: On the construction of analytic sequent calculi for sub-classical logics. In: 21st International Workshop, WoLLIC 2014, Proceedings, pp. 206–220 (2014)

    Google Scholar 

  16. Lellmann, B.: Hypersequent rules with restricted contexts for propositional modal logics. Theor. Comput. Sci. 656, 76–105 (2016)

    Article  MathSciNet  Google Scholar 

  17. Marchioni, E., Montagna, F.: On triangular norms and uninorms definable in ł\(\pi \frac{1}{2}\). Int. J. Approx. Reason. 47(2), 179–201 (2008)

    Article  MathSciNet  Google Scholar 

  18. Metcalfe, G., Montagna, F.: Substructural fuzzy logics. J. Symbolic Logic 72(3), 834–864 (2007)

    Article  MathSciNet  Google Scholar 

  19. Minc, G.E.: Some calculi of modal logic. Trudy Mat. Inst. Steklov 98, 88–111 (1968)

    MathSciNet  MATH  Google Scholar 

  20. Ohnishi, M., Matsumoto, K.: Gentzen method in modal calculi. ii. Osaka Math. J. 11(2), 115–120 (1959)

    MathSciNet  MATH  Google Scholar 

  21. Poggiolesi, F.: A cut-free simple sequent calculus for modal logic S5. Rev. Symbolic Logic 1(1), 3–15 (2008)

    Article  MathSciNet  Google Scholar 

  22. Pottinger, G.: Uniform, cut-free formulations of T, S4 and S5 (abstract). J. Symbolic Logic 48(3), 900 (1983)

    Google Scholar 

  23. Takano, M.: Subformula property as a substitute for cut-elimination in modal propositional logics. Math. Jpn. 37, 1129–1145 (1992)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

Work supported by FWF projects: START 544-N2, W1255-N23 and I 2982. We thank B. Lellmann for bringing the forward proof search complexity argument to our attention.

Author information

Authors and Affiliations

  1. Technische Universität Wien (TU Wien), Vienna, Austria

    Agata Ciabattoni, Timo Lang & Revantha Ramanayake

Authors
  1. Agata Ciabattoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Timo Lang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Revantha Ramanayake
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Agata Ciabattoni .

Editor information

Editors and Affiliations

  1. IBISC, Univ. Evry, Université Paris-Saclay, Evry, France

    Serenella Cerrito

  2. Middlesex University London, London, UK

    Andrei Popescu

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ciabattoni, A., Lang, T., Ramanayake, R. (2019). Bounded Sequent Calculi for Non-classical Logics via Hypersequents. In: Cerrito, S., Popescu, A. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2019. Lecture Notes in Computer Science(), vol 11714. Springer, Cham. https://doi.org/10.1007/978-3-030-29026-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-29026-9_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-29025-2

  • Online ISBN: 978-3-030-29026-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation