Publisher
Springer International Publishing
Reference18 articles.
1. K. Aehlig, A. Beckmann, On the computational complexity of cut reduction. Ann. Pure Appl. Log. 161, 711–736 (2010)
2. M. Baaz, A. Leitsch, Cut normal forms and proof complexity. Ann. Pure Appl. Log. 97, 127–177 (1999)
3. A. Beckmann, S.R. Buss, Separation results for the size of constant-depth propositional proofs. Ann. Pure Appl. Log. 136, 30–55 (2005)
4. A. Beckmann, S.R. Buss, Characterization of definable search problems in bounded arithmetic via proof notations, in Ways of Proof Theory (Ontos Verlag, Frankfurt, 2010), pp. 65–134
5. A. Beckmann, S.R. Buss, Corrected upper bounds for free-cut elimination. Theor. Comput. Sci. 412, 5433–5445 (2011)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The small‐is‐very‐small principle;Mathematical Logic Quarterly;2019-12
2. The Interpretation Existence Lemma;Outstanding Contributions to Logic;2017
3. Transductions in arithmetic;Annals of Pure and Applied Logic;2016-03