Modular Sequent Systems for Modal Logic
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Generic Modal Cut Elimination Applied to Conditional Logics
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Expanding the realm of systematic proof theory
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Journal of Automated Reasoning
Specifying Proof Systems in Linear Logic with Subexponentials
Electronic Notes in Theoretical Computer Science (ENTCS)
Disjunction property and complexity of substructural logics
Theoretical Computer Science
A multiple-conclusion calculus for first-order Gödel logic
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Proof analysis in intermediate logics
Archive for Mathematical Logic
A lambda calculus for gödel---dummett logic capturing waitfreedom
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Metacompleteness of Substructural Logics
Studia Logica
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
From Frame Properties to Hypersequent Rules in Modal Logics
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We introduce a systematic procedure to transform large classesof (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automated generation of analytic calculi for a wide range of propositional nonclassical logics including intermediate, fuzzy and substructural logics. Our work encompasses many existing results, allows for the definition of new calculi and contains a uniform semantic proof of cut-elimination for hypersequent calculi.