On lengths of proofs in non-classical logics

DOI10.1016/J.APAL.2008.09.013zbMATH Open1161.03033OpenAlexW2012102524MaRDI QIDQ1006613FDOQ1006613

Pavel Hrubeš

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

zbMATH Keywords

intuitionistic logicmodal logicpropositional proof complexityfeasible interpolation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Subsystems of classical logic (including intuitionistic logic) (03B20) Complexity of proofs (03F20)

Cites Work

• Title not available (Why is that?)
• The monotone circuit complexity of Boolean functions
• The complexity of the disjunction and existential properties in intuitionistic logic
• Frege systems for extensible modal logics
• Lower bounds for modal logics
• A lower bound for intuitionistic logic

Cited In (12)

• Proof Complexity of Non-classical Logics
• Feasible Interpolation for QBF Resolution Calculi
• Proof complexity of modal resolution
• Towards NP-P via proof complexity and search
• Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss
• Proof complexity of substructural logics
• On the proof complexity of logics of bounded branching
• Proof complexity of intuitionistic implicational formulas
• Proof complexity of propositional default logic
• The number of proof lines and the size of proofs in first order logic
• Universal proof theory: feasible admissibility in intuitionistic modal logics
• Proof Complexity of Non-classical Logics

This page was built for publication: On lengths of proofs in non-classical logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006613)