Labelled KE for intuitionistic propositional logic
From MaRDI portal
Cites work
- A fully labelled proof system for intuitionistic modal logics
- A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics
- A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic
- A Terminating Evaluation-Driven Variant of G3i
- A terminating intuitionistic calculus
- Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic
- Contraction-free sequent calculi for intuitionistic logic
- Efficient SAT-based proof search in intuitionistic propositional logic
- Grafting modalities onto substructural implication systems
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 895271 (Why is no real title available?)
- Intuitionistic logic freed of all metarules
- Labelled modal tableaux
- Proof analysis in non-classical logics
- Proof methods for modal and intuitionistic logics
- SAT modulo intuitionistic implications
- SAT-based proof search in intermediate propositional logics
- Semantic Labelled Tableaux for Propositional BI
- The Taming of the Cut. Classical Refutations with Analytic Cut
- Tractable depth-bounded approximations to \textbf{FDE} and its satellites
This page was built for publication: Labelled KE for intuitionistic propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322996)