On deriving nested calculi for intuitionistic logics from semantic systems
DOI10.1007/978-3-030-36755-8_12zbMATH Open1485.03021arXiv1910.06576OpenAlexW2994955096MaRDI QIDQ2177587FDOQ2177587
Authors: Tim S. Lyon
Publication date: 6 May 2020
Full work available at URL: https://arxiv.org/abs/1910.06576
Recommendations
proof theoryintuitionistic logicKripke semanticslabelled calculinested calculistructural rule elimination
Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)
Cited In (4)
- A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications
- From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic
- A semantical view of proof systems
- On the correspondence between nested calculi and semantic systems for intuitionistic logics
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)