Author of the publication

Transforming and Analyzing Proofs in the CERES-System.

, , , and . LPAR Workshops, volume 418 of CEUR Workshop Proceedings, CEUR-WS.org, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Cut-Elimination: Experiments with CERES., , , , and . LPAR, volume 3452 of Lecture Notes in Computer Science, page 481-495. Springer, (2004)The Computational Content of Arithmetical Proofs.. Notre Dame J. Formal Log., 53 (3): 289-296 (2012)Tree Grammars for the Elimination of Non-prenex Cuts., and . CSL, volume 41 of LIPIcs, page 110-127. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Inductive theorem proving based on tree grammars., and . Ann. Pure Appl. Log., 166 (6): 665-700 (2015)Bondy's Theorem., and . Arch. Formal Proofs, (2012)On the non-confluence of cut-elimination., and . J. Symb. Log., 76 (1): 313-340 (2011)Unprovability results for clause set cycles., and . Theor. Comput. Sci., (2022)On the Completeness of Interpolation Algorithms., and . CoRR, (2024)On the Herbrand content of LK., , and . CL&C, volume 213 of EPTCS, page 1-10. (2016)On the complexity of proof deskolemization., , and . J. Symb. Log., 77 (2): 669-686 (2012)