Comparing the Complexity of Cut-Elimination Methods
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Towards an algorithmic construction of cut-elimination procedures†
Mathematical Structures in Computer Science
CERES: An analysis of Fürstenberg's proof of the infinity of primes
Theoretical Computer Science
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Clausal Approach to Proof Analysis in Second-Order Logic
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Towards a clausal analysis of cut-elimination
Journal of Symbolic Computation
Expansion postponement via cut elimination in sequent calculi for pure type systems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Proof transformations and structural invariance
Algebraic and proof-theoretic aspects of non-classical logics
A sequent calculus with implicit term representation
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Atomic cut introduction by resolution: proof structuring and compression
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
System description: the proof transformation system CERES
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
| Hi-index | 0.00 |