Bounded Sequent Calculi for Non-classical Logics via Hypersequents

Agata Ciabattoni*, Timo Lang, Revantha Ramanayake

*Bijbehorende auteur voor dit werk

OnderzoeksoutputAcademicpeer review

4 Citaten (Scopus)

Samenvatting

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
Originele taal-2English
TitelAutomated Reasoning with Analytic Tableaux and Related Methods
RedacteurenSerenella Cerrito, Andrei Popescu
UitgeverijSpringer
Pagina's94-110
Aantal pagina's17
ISBN van elektronische versie978-3-030-29026-9
ISBN van geprinte versie978-3-030-29025-2
DOI's
StatusPublished - 2019
Extern gepubliceerdJa
Evenement28th International Conference, TABLEAUX 2019 - London, United Kingdom
Duur: 3-sep-20195-sep-2019

Conference

Conference28th International Conference, TABLEAUX 2019
Land/RegioUnited Kingdom
StadLondon
Periode03/09/201905/09/2019

Citeer dit