From post

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.

 

Другие публикации лиц с тем же именем

Bondy's Theorem., и . Arch. Formal Proofs, (2012)On the non-confluence of cut-elimination., и . J. Symb. Log., 76 (1): 313-340 (2011)The Computational Content of Arithmetical Proofs.. Notre Dame J. Formal Log., 53 (3): 289-296 (2012)Cut-Elimination: Experiments with CERES., , , , и . LPAR, том 3452 из Lecture Notes in Computer Science, стр. 481-495. Springer, (2004)Tree Grammars for the Elimination of Non-prenex Cuts., и . CSL, том 41 из LIPIcs, стр. 110-127. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Inductive theorem proving based on tree grammars., и . Ann. Pure Appl. Log., 166 (6): 665-700 (2015)Unprovability results for clause set cycles., и . Theor. Comput. Sci., (2022)On the Completeness of Interpolation Algorithms., и . CoRR, (2024)A Graph-Theoretic Approach to Steganography., и . Communications and Multimedia Security, том 3677 из Lecture Notes in Computer Science, стр. 119-128. Springer, (2005)Project Presentation: Algorithmic Structuring and Compression of Proofs (ASCOP).. AISC/MKM/Calculemus, том 7362 из Lecture Notes in Computer Science, стр. 438-442. Springer, (2012)