On the complexity of the disjunction property in intuitionistic and modal logics

DOI10.1145/1071596.1071598zbMath1367.03019OpenAlexW2075419333MaRDI QIDQ5277730

Guido Fiorino, Mauro Ferrari, Camillo Fiorentini

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2434/4800

zbMATH Keywords

modal logicintuitionistic logicfeasible interpolationproof-length

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20) Complexity of proofs (03F20)

Related Items (5)

New generalizations of set valued interpolative Hardy-Rogers type contractions in $b$-metric spaces ⋮ Frege systems for extensible modal logics ⋮ Proof Complexity of Non-classical Logics ⋮ Substitution Frege and extended Frege proof systems in non-classical logics ⋮ On the proof complexity of logics of bounded branching

This page was built for publication: On the complexity of the disjunction property in intuitionistic and modal logics