Author:
Baaz Matthias,Leitsch Alexander
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Baaz, M., Leitsch, A.: On skolemization and proof complexity Fundamenta Informaticae, 20/4, pp. 353–379 (1994).
2. Baaz, M., Leitsch, A.: Cut Normal Forms and Proof Complexity, Technical Report TR-CS-BL-96-1, Institut für Computersprachen, TU Wien (1996).
3. Gentzen, G.: Untersuchungen über das logische Schließen, Mathematische Zeitschrift 39, pp. 176–210, pp. 405–431 (1934–1935).
4. Goad, C.A.: Computational Uses of the Manipulation of Formal Proofs, Ph.D. Thesis, Stanford University (1980)
5. Orevkov, V.P.: Lower bounds for increasing complexity of derivations after cut-elimination (translation), Journal of Soviet Mathematics, pp. 2337–2350 (1982).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献