Relating sequent calculi for bi-intuitionistic propositional logic
From MaRDI portal
(Redirected from Publication:4964699)
Recommendations
- A proof-theoretic study of bi-intuitionistic propositional sequent calculus
- A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
- Deep Inference in Bi-intuitionistic Logic
- Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents
- Combining derivations and refutations for cut-free completeness in bi-intuitionistic logic
Cited in
(23)- Syntactical investigations into \(BI\) logic and \(BB^ \prime I\) logic
- Natural deduction for bi-intuitionistic logic
- A connection-based characterization of bi-intuitionistic validity
- Bi-simulating in bi-intuitionistic logic
- Bi-classical connexive logic and its modal extension: cut-elimination, completeness and duality
- Combining derivations and refutations for cut-free completeness in bi-intuitionistic logic
- Deep Inference in Bi-intuitionistic Logic
- Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents
- scientific article; zbMATH DE number 2051680 (Why is no real title available?)
- A comparison between monoidal and substructural logics
- A proof-theoretic study of bi-intuitionistic propositional sequent calculus
- Equality and Apartness in Bi-intuitinistic Logic
- Bi-intuitionistic logics: a new instance of an old problem
- A connection-based characterization of bi-intuitionistic validity
- A representation of proper BC domains based on conjunctive sequent calculi
- On the Blok-Esakia theorem
- Analytic cut and interpolation for bi-intuitionistic logic
- Bi-intuitionistic implication structures
- Monoidal logics: completeness and classical systems
- A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
- Analytic cut and Mints' symmetric interpolation method for bi-intuitionistic tense logic
- Symmetric and conflated intuitionistic logics
- Taking bi-intuitionistic logic first-order: a proof-theoretic investigation via polytree sequents
This page was built for publication: Relating sequent calculi for bi-intuitionistic propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964699)