The following pages link to On the number of steps in proofs (Q1119576):
Displayed 11 items.
- Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel). (Q930260) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- A unification-theoretic method for investigating the \(k\)-provability problem (Q1814133) (← links)
- Some remarks on lengths of propositional proofs (Q1908815) (← links)
- Essential structure of proofs as a measure of complexity (Q2183713) (← links)
- Von Neumann, Gödel and Complexity Theory (Q3067861) (← links)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- Polynomially and superexponentially shorter proofs in fragments of arithmetic (Q4032866) (← links)
- Simulation of Natural Deduction and Gentzen Sequent Calculus (Q4683217) (← links)