Algorithmic proof methods and cut elimination for implicational logics. I: Modal implication

DOI10.1023/A:1005077431494zbMath0962.03013OpenAlexW1509743236MaRDI QIDQ1580655

Nicola Olivetti, Dov M. Gabbay

Publication date: 13 June 2001

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005077431494

zbMATH Keywords

modal logiccut-eliminationimplicational fragmentlabelled deductive systemsstrict implicationcut admissibilitygoal directed proof theory for nonclassical logicsgoal-directed deduction methodsstrongly analytical proof systems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35) Cut-elimination and normal-form theorems (03F05)

This page was built for publication: Algorithmic proof methods and cut elimination for implicational logics. I: Modal implication