scientific article; zbMATH DE number 2187723

MaRDI QIDQ5460922zbMATH OpenFDO

Authors

Publication date 20 July 2005

Full work available at URL https://eudml.org/doc/224153

zbMATH Keywords

Frege systempolynomial equivalenceproof system

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)

Recommendations

• Frege systems for extensible modal logics
• Propositional consistency proofs
• Comparison of several proof systems of intuitionistic propositional logic
• A lower bound for intuitionistic logic
• The deduction rule and linear and near-linear proof simulations

Cited in

(11)

• Substitution Frege and extended Frege proof systems in non-classical logics
• On the proof complexity of logics of bounded branching
• Frege systems for extensible modal logics
• Comparison of several proof systems of intuitionistic propositional logic
• Proof complexity of intuitionistic implicational formulas
• scientific article; zbMATH DE number 2020149 (Why is no real title available?)
• scientific article; zbMATH DE number 806744 (Why is no real title available?)
• On non-monotonous properties of some classical and nonclassical propositional proof systems
• Proof complexity of non-classical logics
• A simplified lower bound for implicational logic
• A lower bound for intuitionistic logic

This page was built for publication:

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