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.
CITATION STYLE
Pimentel, E., Ramanayake, R., & Lellmann, B. (2019). Sequentialising Nested Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11714 LNAI, pp. 147–165). Springer. https://doi.org/10.1007/978-3-030-29026-9_9
Mendeley helps you to discover research relevant for your work.