Uniform Proof Complexity

DOI10.1093/LOGCOM/EXI035MaRDI QIDQ5696301zbMATH OpenOpenAlexFDO

Authors Arnold Beckmann

Publication date 18 October 2005

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/91f2be6082b3ceb697f167b886433e62cfeb98fd

zbMATH Keywords

bounded arithmetictranslationsarithmetic complexitypropositional proof systempropositional calculuslength of proofsuniform reduct

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 2102736
• Logical foundations of proof complexity
• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 1390276
• scientific article; zbMATH DE number 1342249

Cited in

(4)

• P-uniform circuit complexity
• Deterministic unimodularity certification
• On the computational complexity of cut-reduction
• Expressing uniformity via oracles

This page was built for publication: Uniform Proof Complexity

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