Some Results on the Length of Proofs
From MaRDI portal
Publication:5686023
DOI10.2307/1996581zbMath0269.02011OpenAlexW4252443779MaRDI QIDQ5686023
Publication date: 1973
Full work available at URL: https://doi.org/10.2307/1996581
Decidability of theories and sets of sentences (03B25) Algorithms in computer science (68W99) Proof theory and constructive mathematics (03F99)
Related Items
VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY, The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem, The Kreisel length-of-proof problem, Generalizing theorems in real closed fields, The number of proof lines and the size of proofs in first order logic, A theorem on generalizations of proofs, Proof generalization in \(\mathrm {LK}\) by second order unifier minimization, On the number of steps in proofs, Essential structure of proofs as a measure of complexity, Speed-Up by Theories with Infinite Models, Herbrand complexity and the epsilon calculus with equality, The undecidability of the second-order unification problem, Generalizing proofs in monadic languages (with a postscript by Georg Kreisel)., The undecidability of \(k\)-provability, On meta complexity of propositional formulas and propositional proofs, Parikh and Wittgenstein, The Heterogeneity of Mathematical Research, Interpolants, cut elimination and flow graphs for the propositional calculus, Remark on Kreisel's conjecture, Herbrand's theorem and term induction, Paraconsistent informational logic, Proof schemata in Hilbert-type axiomatic theories, A unification-theoretic method for investigating the \(k\)-provability problem, \(k\)-provability in \(\mathrm{PA}\), Informational logic for automated reasoning, A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata, Bounded arithmetic, proof complexity and two papers of Parikh, Simple second-order languages for which unification is undecidable, Farmer's theorem revisited
Cites Work
