On lengths of proofs in non-classical logics
From MaRDI portal
Publication:1006613
DOI10.1016/j.apal.2008.09.013zbMath1161.03033MaRDI QIDQ1006613
Publication date: 25 March 2009
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2008.09.013
03B45: Modal logic (including the logic of norms)
03B20: Subsystems of classical logic (including intuitionistic logic)
03F20: Complexity of proofs
Related Items
Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss, Proof Complexity of Non-classical Logics, Proof complexity of intuitionistic implicational formulas, Towards NP-P via proof complexity and search, Proof complexity of propositional default logic, Feasible Interpolation for QBF Resolution Calculi
Cites Work