Author:
Baaz Matthias,Leitsch Alexander
Subject
Computational Mathematics,Algebra and Number Theory
Reference11 articles.
1. On skolemization and proof complexity;Baaz;Fundamenta Informaticae,1994
2. Cut normal forms and proof complexity;Baaz;Annals of Pure and Applied Logic,1999
3. Cut-elimination and redundancy-elimination by resolution;Baaz;Journal of Symbolic Computation,2000
4. Generalizing theorems in real closed fields;Baaz;Annals of Pure and Applied Logic,1995
5. Untersuchungen über das logische Schließen;Gentzen;Mathematische Zeitschrift,1934
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Completeness of Interpolation Algorithms;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Cut-Restriction: From Cuts to Analytic Cuts;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Gentzen’s ‘Cut Rule’ and Quantum Measurement in Terms of Hilbert Arithmetic. Metaphor and Understanding Modeled Formally;SSRN Electronic Journal;2022
4. Extraction of Expansion Trees;Journal of Automated Reasoning;2018-01-27
5. Towards a Clausal Analysis of Proof Schemata;2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2017-09