Deep Inference in Bi-intuitionistic Logic
From MaRDI portal
Publication:3638293
DOI10.1007/978-3-642-02261-6_26zbMATH Open1246.03074OpenAlexW1836554196MaRDI QIDQ3638293FDOQ3638293
Authors: Linda Postniece
Publication date: 2 July 2009
Published in: Logic, Language, Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02261-6_26
Recommendations
- A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
- Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents
- A proof-theoretic study of bi-intuitionistic propositional sequent calculus
- Relating sequent calculi for bi-intuitionistic propositional logic
- Cut-elimination and proof search for bi-intuitionistic tense logic
Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)
Cites Work
- Combining derivations and refutations for cut-free completeness in bi-intuitionistic logic
- Substructural logics on display
- Deep sequent systems for modal logic
- Cut-free sequent calculi for some tense logics
- A system of interaction and structure
- A Formulae-as-Types Interpretation of Subtractive Logic
- Title not available (Why is that?)
- Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents
- Contraction-free sequent calculi for intuitionistic logic
- Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents
- Analyzing the core of categorial grammar
- A Local System for Intuitionistic Logic
- Taming displayed tense logics using nested sequents with deep inference
Cited In (10)
- Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents
- Nested sequents for intuitionistic logics
- Cut-elimination and proof search for bi-intuitionistic tense logic
- A proof-theoretic study of bi-intuitionistic propositional sequent calculus
- A connection-based characterization of bi-intuitionistic validity
- A connection-based characterization of bi-intuitionistic validity
- Combining derivations and refutations for cut-free completeness in bi-intuitionistic logic
- Relating sequent calculi for bi-intuitionistic propositional logic
- Proofs, disproofs, and their duals
- Annotation-free sequent calculi for full intuitionistic linear logic
This page was built for publication: Deep Inference in Bi-intuitionistic Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638293)