Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Buss (1995)
On Gödel’s Theorems on Lengths of Proofs II: Lower Bounds for Recognizing k Symbol Provability
J. Krajícek (1989)
On the Number of Steps in ProofsAnn. Pure Appl. Log., 41
S.R. Buss (1987)
Polynomial size proofs of the propositional pigeonhole principleJ. Symb. Logic, 52
S. Cook, R. Reckhow (1974)
On the lengths of proofs in the propositional calculus (Preliminary Version)
J. Krajíček (1989)
Speed-up for propositional Frege systems via generalizations of proofsCommentationes Mathematicae Universitatis Carolinae, 30
T. Pitassi, P. Beame, R. Impagliazzo (1993)
Exponential lower bounds for the pigeonhole principlecomputational complexity, 3
S. Cook, R. Reckhow (1979)
The Relative Efficiency of Propositional Proof SystemsLogic, Automata, and Computational Complexity
Jan Cek, Pavel Ak, Alan Woods
Electronic Colloquium on Computational Complexity an Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
J. Krajícek, P. Pudlák (1989)
Propositional proof systems, the consistency of first order theories and the complexity of computationsJournal of Symbolic Logic, 54
G. Cejtin, A. Čubarjan (1975)
On some bounds to the lengths of logical proofs in classical propositional calculus (Russian)Trudy Vyčisl. Centra AN ArmSSR i Erevan. Univ., 8
S.A. Cook, R.A. Reckhow (1979)
The relative efficiency of propositional proof systemsJ. Symb. Logic, 44
S.R. Buss (1995)
Feasible Mathematics vol. II
(1993)
Number of symbols in Frege proofs with and without the deduction rule, in Arithmetic, Proof Theory and Computational Complexity
S. Buss (1991)
The Undecidability of k-ProvabilityAnn. Pure Appl. Log., 53
(1985)
Model-theoretic aspects of P 6= NP
(1988)
Weak formal systems and connections to computational complexity. Student-written Lecture Notes for a Topics Course at U.C. Berkeley
M.L. Bonet (1993)
Arithmetic, Proof Theory and Computational Complexity
W. Farmer (1991)
Review: Jan Krajicek, On the Number of Steps in Proofs
G. Takeuti (1987)
Proof Theory
Maria Bonet, S. Buss (1993)
The deduction rule and linear and near-linear proof simulationsJournal of Symbolic Logic, 58
R. Statman (1977)
Logic Colloquium ’76
Jan mIček (1989)
On the number of steps in proofsAnnals of Pure and Applied Logic, 41
R. Statman (1977)
Complexity of Derivations from Quantifier-Free Horn Formulae, Mechanical Introduction of Explicit Definitions, and Refinement of Completeness TheoremsStudies in logic and the foundations of mathematics, 87
We survey the best known lower bounds on symbols and lines in Frege and extended Frege proofs. We prove that in minimum length sequent calculus proofs, no formula is generated twice or used twice on any single branch of the proof. We prove that the number of distinct subformulas in a minimum length Frege proof is linearly bounded by the number of lines. Depthd Frege proofs ofm lines can be transformed into depthd proofs ofO(m d+1) symbols. We show that renaming Frege proof systems are p-equivalent to extended Frege systems. Some open problems in propositional proof length and in logical flow graphs are discussed.
Archive for Mathematical Logic – Springer Journals
Published: Mar 30, 2006
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.