On the complexity of the disjunction property in intuitionistic and modal logics
From MaRDI portal
Publication:5277730
DOI10.1145/1071596.1071598zbMath1367.03019MaRDI 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
03B45: Modal logic (including the logic of norms)
03F05: Cut-elimination and normal-form theorems
03B20: Subsystems of classical logic (including intuitionistic logic)
03F20: Complexity of proofs
Related Items
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, New generalizations of set valued interpolative Hardy-Rogers type contractions in $b$-metric spaces, Frege systems for extensible modal logics