On deriving nested calculi for intuitionistic logics from semantic systems
From MaRDI portal
Publication:2177587
Abstract: This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable proof-theoretic properties from its associated labelled calculus.
Recommendations
Cited in
(5)- A semantical view of proof systems
- From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic
- A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications
- On the correspondence between nested calculi and semantic systems for intuitionistic logics
- Nested sequents or tree-hypersequents -- a survey
This page was built for publication: On deriving nested calculi for intuitionistic logics from semantic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177587)