Labelled tree sequents, tree hypersequents and nested (deep) sequents

MaRDI QIDQ5419884zbMATH OpenFDO

Authors Rajeev Goré, Revantha Ramanayake

Publication date 11 June 2014

zbMATH Keywords

cut eliminationlabelled sequentsnonstandard sequent calculinotational variantsproof theoryprovability logictree hypersequents

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Recommendations

• Hypersequent and labelled calculi for intermediate logics
• A semantical view of proof systems
• Hypersequent and display calculi -- a unified perspective
• Sequentialising nested systems
• Linear Nested Sequents, 2-Sequents and Hypersequents

Cited in

(17)

• Multicomponent proof-theoretic method for proving interpolation properties
• Nested sequents for intuitionistic modal logics via structural refinement
• A pure view of ecumenical modalities
• Proofs and countermodels in non-classical logics
• Hypersequent and display calculi -- a unified perspective
• Disentangling structural connectives or life without display property
• Inducing syntactic cut-elimination for indexed nested sequents
• Proving Craig and Lyndon interpolation using labelled sequent calculi
• Through an inference rule, darkly
• Linear Nested Sequents, 2-Sequents and Hypersequents
• Inducing syntactic cut-elimination for indexed nested sequents
• Grafting hypersequents onto nested sequents
• A general proof certification framework for modal logic
• Separability and harmony in ecumenical systems
• Nested sequents or tree-hypersequents -- a survey
• Beyond semantic pollution: towards a practice-based philosophical analysis of labelled calculi
• Unifying sequent systems for Gödel-Löb provability logic via syntactic transformations

This page was built for publication: Labelled tree sequents, tree hypersequents and nested (deep) sequents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419884)