Maria Luisa Bonet, Samuel R. Buss  Home/Search
Context Related
| ucsd.edu/~sbuss/ResearchWeb/...paper.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsd.edu/~sbuss/ResearchW...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in Frege proof systems compared to lengths in these new systems. (Update)
Context of citations to this paper: More
.... similar to the contents of sections 2 and 3 includes Cejtin Cubarjan[7] Buss et al. 6] Kraj icek [11, 10] Bonet [1] Bonet Buss [2], and Buss [5] In section 4, we define a new version PK of the propositional sequent calculus and pose the problem of finding a (1...
...of whether tree like sF simulates dag like sF with a logarithmic factor of increment in the number of lines. This result holds for F ([BB]) and we prove it for eF . At his point is still open if the same holds for sF . Nevertheless, we are able to show a polynomial...
Cited by: More
Some Remarks on Lengths of Propositional Proofs - Buss (2002) (Correct)
Linear lower bounds and simulations in Frege systems with.. - Bonet, Galesi (1997) (Correct)
Active bibliography (related documents): More All
0.7: The Serial Transitive Closure Problem for Trees Maria Luisa.. - Samuel Buss July (Correct)
0.6: On the Deduction Rule and - The Number Of (Correct)
0.5: How to Lie Without Being (easily) Convicted and the Lengths of .. - Pudlak, Buss (Correct)
Similar documents based on text: More All
0.4: Are There Hard Examples for Frege Proof Systems? - Bonet, Buss, Pitassi (1995) (Correct)
0.2: Lower Bounds for Cutting Planes Proofs with Small Coefficients - Bonet, Pitassi, Raz (1995) (Correct)
0.2: No Feasible Interpolation for TC 0 -Frege Proofs - Bonet, Pitassi, Raz (1997) (Correct)
Related documents from co-citation: More All
3: Number of symbols in Frege proofs with and without the deduction rule (context) - Bonet - 1993
3: Annals of Pure and Applied Logic (context) - Kraj'icek, number et al. - 1989
3: the consistency of first order theories and the complexity of computations (context) - KRAJ, CEK et al. - 1989
BibTeX entry: (Update)
M. L. Bonet and S. R. Buss, The deduction rule and linear and nearlinear proof simulations, Journal of Symbolic Logic, 58 (1993), pp. 688-- 709. http://citeseer.ist.psu.edu/bonet93deduction.html More
@article{ bonet93deduction,
author = "Maria Luisa Bonet and Samuel R. Buss",
title = "The Deduction Rule and Linear and Near-Linear Proof Simulations",
journal = "The Journal of Symbolic Logic",
volume = "58",
number = "2",
pages = "688-709",
year = "1993",
url = "citeseer.ist.psu.edu/bonet93deduction.html" }
Citations (may not include all citations):343 Introduction to Metamathematics (context) - Kleene - 1971
116 Ideas and results in proof theory (context) - Prawitz - 1971
104 Exponential lower bounds for the pigeonhole principle (context) - Pitassi, Beame et al. - 1993
103 Bounded Arithmetic (context) - Buss
72 North-Holland (context) - Takeuti, Theory - 1987
62 The Collected Papers of Gerhard Gentzen (context) - Szabo - 1969
56 Feasibly constructive proofs and the propositional calculus (context) - Cook - 1975
47 the Lengths of Proofs in the Propositional Calculus (context) - Reckhow - 1976
42 ciency of propositional proof systems (context) - Cook, Reckhow et al. - 1979
13 Complexity of derivations from quantifier-free Horn formulae (context) - Statman - 1977
13 SIAM Journal on Computing (context) - serial, problem - 1995
5 The Lengths of Propositional Proofs and the Deduction Rule (context) - Bonet - 1991
3 Soviet Mathematics Doklady (context) - of, from et al.
2 the deduction rule and the number of proof lines (context) - Bonet, Buss - 1991
2 Upper bound on the lengthening of proofs by cut elimination (context) - Orevkov
2 Lower bounds to the size of constant-depth Frege proofs (context) - cek - 1994
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC