Publisher
Springer Science and Business Media LLC
Reference17 articles.
1. Bonet, M.L.: Number of symbols in Frege proofs with and without the deduction rule. In: Clote, P., Krajíček, J. (eds.) Arithmetic, Proof Theory and Computational Complexity, pp. 61–95. Oxford: Oxford University Press 1993
2. Bonet, M.L., Buss, S.R.: The deduction rule and linear and near-linear proof simulations. J. Symb. Logic58, 688–709 (1993)
3. Buss, S.R.: Polynomial size proofs of the propositional pigeonhole principle. J. Symb. Logic52, 916–927 (1987)
4. Buss, S.R.: The undecidability ofk-provability. Ann. Pure Appl. Logic53, 75–102 (1991)
5. Buss, S.R.: On Gödel’s theorems on lengths of proofs II: Lower bounds for recognizingk symbol provability. In: Clote, P., Remmel, J. (eds.) Feasible Mathematics vol. II, pp. 57–90 Boston: Birkhäuser 1995
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tradeoffs for small-depth Frege proofs;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
2. Substitution and Propositional Proof Complexity;Outstanding Contributions to Logic;2021-09-25
3. Bibliography;Proof Complexity;2019-03-28
4. The Nature of Proof Complexity;Proof Complexity;2019-03-28
5. Model Theory and Lower Bounds;Proof Complexity;2019-03-28