Bounded Sequent Calculi for Non-classical Logics via Hypersequents

Agata Ciabattoni*, Timo Lang, Revantha Ramanayake

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)

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
Original languageEnglish
Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods
EditorsSerenella Cerrito, Andrei Popescu
PublisherSpringer
Pages94-110
Number of pages17
ISBN (Electronic)978-3-030-29026-9
ISBN (Print)978-3-030-29025-2
DOIs
Publication statusPublished - 2019
Externally publishedYes
Event28th International Conference, TABLEAUX 2019 - London, United Kingdom
Duration: 3-Sep-20195-Sep-2019

Conference

Conference28th International Conference, TABLEAUX 2019
Country/TerritoryUnited Kingdom
CityLondon
Period03/09/201905/09/2019

Cite this