Sequentialising Nested Systems

Elaine Pimentel*, Revantha Ramanayake, Björn Lellmann

*Bijbehorende auteur voor dit werk

OnderzoeksoutputAcademicpeer review

3 Citaten (Scopus)

Samenvatting

In this work, we investigate the proof theoretic connections between sequent and nested proof calculi. Specifically, we identify general conditions under which a nested calculus can be transformed into a sequent calculus by restructuring the nested sequent derivation (proof) and shedding extraneous information to obtain a derivation of the same formula in the sequent calculus. These results are formulated generally so that they apply to calculi for intuitionistic, normal modal logics and negative modalities.

Originele taal-2English
TitelAutomated Reasoning with Analytic Tableaux and Related Methods
RedacteurenSerenella Cerrito, Andrei Popescu
UitgeverijSpringer
Pagina's147-165
Aantal pagina's19
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