A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
From MaRDI portal
Publication:5434482
DOI10.1007/978-3-540-73099-6_9zbMath1133.03027OpenAlexW1854821975MaRDI QIDQ5434482
Publication date: 4 January 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73099-6_9
Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (7)
Natural deduction for bi-intuitionistic logic ⋮ Bi-Classical Connexive Logic and its Modal Extension: Cut-elimination, completeness and duality ⋮ Constructive negation, implication, and co-implication ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ Stipulation and Symmetrical Consequence ⋮ On the Blok-Esakia Theorem ⋮ ANALYTIC CUT AND INTERPOLATION FOR BI-INTUITIONISTIC LOGIC
This page was built for publication: A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
