Uniform Proof Complexity

DOI10.1093/LOGCOM/EXI035zbMath1082.03049OpenAlexW2033014810MaRDI QIDQ5696301

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

translationsbounded arithmeticpropositional calculusarithmetic complexitypropositional proof systemlength of proofsuniform reduct

Mathematics Subject Classification ID

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

This page was built for publication: Uniform Proof Complexity