Author:
Baaz Matthias,Hetzl Stefan,Leitsch Alexander,Richter Clemens,Spohr Hendrik
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Baaz, M., Leitsch, A.: On skolemization and proof complexity. Fundamenta Informaticae 20(4), 353–379 (1994)
2. Baaz, M., Leitsch, A.: Cut-Elimination and Redundancy-Elimination by Resolution. Journal of Symbolic Computation 29, 149–176 (2000)
3. Baaz, M., Leitsch, A.: Towards a Clausal Analysis of Cut-Elimination. Journal of Symbolic Computation to appear
4. Gentzen, G.: Untersuchungen über das logische Schließen. Mathematische Zeitschrift 39, 405–431 (1934)
5. Girard, J.Y.: Proof Theory and Logical Complexity. In: Studies in Proof Theory, Bibliopolis, Napoli (1987)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Expansion trees with cut;Mathematical Structures in Computer Science;2019-09
2. Extraction of Expansion Trees;Journal of Automated Reasoning;2018-01-27
3. Cut-Elimination and Proof Schemata;Logic, Language, and Computation;2015
4. Advanced Proof Viewing in ProofTool;Electronic Proceedings in Theoretical Computer Science;2014-10-29
5. Understanding Resolution Proofs through Herbrand’s Theorem;Lecture Notes in Computer Science;2013