Deep Inference in Bi-intuitionistic Logic

DOI10.1007/978-3-642-02261-6_26MaRDI QIDQ3638293zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)

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

Cites work

• scientific article; zbMATH DE number 3689368 (Why is no real title available?)
• A Formulae-as-Types Interpretation of Subtractive Logic
• A Local System for Intuitionistic Logic
• A system of interaction and structure
• Analyzing the core of categorial grammar
• Combining derivations and refutations for cut-free completeness in bi-intuitionistic logic
• Contraction-free sequent calculi for intuitionistic logic
• Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents
• Cut-free sequent calculi for some tense logics
• Deep sequent systems for modal logic
• Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents
• Substructural logics on display
• Taming displayed tense logics using nested sequents with deep inference

Cited in

(10)

• Relating sequent calculi for bi-intuitionistic propositional logic
• Proofs, disproofs, and their duals
• Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents
• A proof-theoretic study of bi-intuitionistic propositional sequent calculus
• A connection-based characterization of bi-intuitionistic validity
• Cut-elimination and proof search for bi-intuitionistic tense logic
• Nested sequents for intuitionistic logics
• A connection-based characterization of bi-intuitionistic validity
• Combining derivations and refutations for cut-free completeness in bi-intuitionistic logic
• 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)